/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/ldv-sets/test_add-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:31:11,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:31:11,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:31:12,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:31:12,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:31:12,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:31:12,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:31:12,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:31:12,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:31:12,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:31:12,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:31:12,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:31:12,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:31:12,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:31:12,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:31:12,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:31:12,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:31:12,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:31:12,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:31:12,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:31:12,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:31:12,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:31:12,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:31:12,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:31:12,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:31:12,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:31:12,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:31:12,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:31:12,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:31:12,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:31:12,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:31:12,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:31:12,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:31:12,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:31:12,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:31:12,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:31:12,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:31:12,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:31:12,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:31:12,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:31:12,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:31:12,120 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 [2020-11-06 22:31:12,173 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:31:12,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:31:12,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:31:12,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:31:12,179 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:31:12,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:31:12,179 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:31:12,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:31:12,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:31:12,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:31:12,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:31:12,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:31:12,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:31:12,182 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:31:12,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:31:12,182 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:31:12,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:31:12,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:31:12,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:31:12,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:31:12,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:31:12,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:31:12,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:31:12,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:31:12,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:31:12,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:31:12,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:31:12,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:31:12,186 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:31:12,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:31:12,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:31:12,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:31:12,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:31:12,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:31:12,651 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:31:12,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_add-2.i [2020-11-06 22:31:12,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597e5a810/2b8198d5c25445788b96e8320e46ad7a/FLAGc35a14742 [2020-11-06 22:31:13,465 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:31:13,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_add-2.i [2020-11-06 22:31:13,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597e5a810/2b8198d5c25445788b96e8320e46ad7a/FLAGc35a14742 [2020-11-06 22:31:13,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597e5a810/2b8198d5c25445788b96e8320e46ad7a [2020-11-06 22:31:13,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:31:13,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:31:13,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:31:13,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:31:13,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:31:13,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:13" (1/1) ... [2020-11-06 22:31:13,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c90709a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:13, skipping insertion in model container [2020-11-06 22:31:13,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:13" (1/1) ... [2020-11-06 22:31:13,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:31:13,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:31:14,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:31:14,148 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:31:14,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:31:14,322 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:31:14,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14 WrapperNode [2020-11-06 22:31:14,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:31:14,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:31:14,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:31:14,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:31:14,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (1/1) ... [2020-11-06 22:31:14,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (1/1) ... [2020-11-06 22:31:14,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (1/1) ... [2020-11-06 22:31:14,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (1/1) ... [2020-11-06 22:31:14,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (1/1) ... [2020-11-06 22:31:14,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (1/1) ... [2020-11-06 22:31:14,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (1/1) ... [2020-11-06 22:31:14,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:31:14,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:31:14,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:31:14,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:31:14,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (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 [2020-11-06 22:31:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:31:14,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:31:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-06 22:31:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-06 22:31:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:31:14,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:31:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-11-06 22:31:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2020-11-06 22:31:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-11-06 22:31:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-11-06 22:31:14,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-11-06 22:31:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-11-06 22:31:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-11-06 22:31:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-11-06 22:31:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2020-11-06 22:31:14,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2020-11-06 22:31:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2020-11-06 22:31:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2020-11-06 22:31:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2020-11-06 22:31:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2020-11-06 22:31:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-11-06 22:31:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:31:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-06 22:31:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-06 22:31:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-06 22:31:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-06 22:31:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-06 22:31:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-06 22:31:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-06 22:31:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-06 22:31:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-06 22:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-06 22:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-06 22:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-06 22:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-06 22:31:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-06 22:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-06 22:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-06 22:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-06 22:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-06 22:31:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-06 22:31:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-06 22:31:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-06 22:31:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-06 22:31:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-06 22:31:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-06 22:31:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-06 22:31:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-06 22:31:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-06 22:31:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-06 22:31:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-06 22:31:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-06 22:31:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-06 22:31:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-06 22:31:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-06 22:31:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-06 22:31:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-06 22:31:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-06 22:31:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-06 22:31:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-06 22:31:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-06 22:31:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-06 22:31:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-06 22:31:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-06 22:31:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-06 22:31:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-06 22:31:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-06 22:31:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-06 22:31:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-06 22:31:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-06 22:31:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-06 22:31:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-06 22:31:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-06 22:31:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-06 22:31:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:31:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-06 22:31:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-06 22:31:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-06 22:31:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-06 22:31:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-06 22:31:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-06 22:31:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-06 22:31:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:31:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-06 22:31:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-06 22:31:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-06 22:31:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-06 22:31:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-06 22:31:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-06 22:31:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-06 22:31:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-06 22:31:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-06 22:31:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-06 22:31:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-06 22:31:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-06 22:31:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-06 22:31:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-06 22:31:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-06 22:31:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-06 22:31:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-06 22:31:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-06 22:31:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-06 22:31:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-06 22:31:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-06 22:31:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-06 22:31:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-06 22:31:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-06 22:31:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-06 22:31:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-06 22:31:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-06 22:31:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-06 22:31:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-06 22:31:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-06 22:31:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-06 22:31:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-06 22:31:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-06 22:31:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-06 22:31:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-06 22:31:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-06 22:31:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-06 22:31:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-06 22:31:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-06 22:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-06 22:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-06 22:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:31:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:31:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:31:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-11-06 22:31:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:31:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2020-11-06 22:31:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-11-06 22:31:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:31:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-11-06 22:31:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-11-06 22:31:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-11-06 22:31:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:31:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-11-06 22:31:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-11-06 22:31:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2020-11-06 22:31:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2020-11-06 22:31:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2020-11-06 22:31:14,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2020-11-06 22:31:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2020-11-06 22:31:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2020-11-06 22:31:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:31:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:31:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:31:14,490 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-11-06 22:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-06 22:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:31:15,156 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:31:15,156 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-06 22:31:15,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:15 BoogieIcfgContainer [2020-11-06 22:31:15,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:31:15,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:31:15,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:31:15,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:31:15,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:31:13" (1/3) ... [2020-11-06 22:31:15,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236e8087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:15, skipping insertion in model container [2020-11-06 22:31:15,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:14" (2/3) ... [2020-11-06 22:31:15,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236e8087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:15, skipping insertion in model container [2020-11-06 22:31:15,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:15" (3/3) ... [2020-11-06 22:31:15,167 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2020-11-06 22:31:15,182 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:31:15,186 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:31:15,198 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:31:15,224 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:31:15,225 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:31:15,225 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:31:15,225 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:31:15,225 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:31:15,225 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:31:15,225 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:31:15,225 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:31:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-11-06 22:31:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:31:15,249 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:15,250 INFO L422 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] [2020-11-06 22:31:15,250 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1016243908, now seen corresponding path program 1 times [2020-11-06 22:31:15,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:15,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528197306] [2020-11-06 22:31:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:31:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:31:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-06 22:31:15,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528197306] [2020-11-06 22:31:15,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269646051] [2020-11-06 22:31:15,768 INFO L95 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 [2020-11-06 22:31:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:15,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-06 22:31:15,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:16,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:31:16,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2020-11-06 22:31:16,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478503916] [2020-11-06 22:31:16,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:31:16,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:31:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:31:16,059 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2020-11-06 22:31:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:16,105 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2020-11-06 22:31:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:31:16,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:31:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:16,117 INFO L225 Difference]: With dead ends: 107 [2020-11-06 22:31:16,117 INFO L226 Difference]: Without dead ends: 52 [2020-11-06 22:31:16,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:31:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-06 22:31:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-06 22:31:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-06 22:31:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-11-06 22:31:16,164 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 30 [2020-11-06 22:31:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:16,165 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-11-06 22:31:16,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:31:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-11-06 22:31:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:31:16,168 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:16,168 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-06 22:31:16,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-11-06 22:31:16,383 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash -20648475, now seen corresponding path program 1 times [2020-11-06 22:31:16,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:16,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093613837] [2020-11-06 22:31:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:16,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:16,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:31:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:16,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:16,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:31:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:16,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093613837] [2020-11-06 22:31:16,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551480943] [2020-11-06 22:31:16,643 INFO L95 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 [2020-11-06 22:31:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:16,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 47 conjunts are in the unsatisfiable core [2020-11-06 22:31:16,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:16,859 INFO L382 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 [2020-11-06 22:31:16,860 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:16,875 INFO L382 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 [2020-11-06 22:31:16,876 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:16,885 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:16,885 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2020-11-06 22:31:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:31:17,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:31:17,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2020-11-06 22:31:17,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734055850] [2020-11-06 22:31:17,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:31:17,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:31:17,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:31:17,096 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 9 states. [2020-11-06 22:31:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:17,688 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2020-11-06 22:31:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:31:17,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-11-06 22:31:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:17,690 INFO L225 Difference]: With dead ends: 99 [2020-11-06 22:31:17,691 INFO L226 Difference]: Without dead ends: 81 [2020-11-06 22:31:17,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2020-11-06 22:31:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-06 22:31:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2020-11-06 22:31:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-06 22:31:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-11-06 22:31:17,704 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2020-11-06 22:31:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:17,705 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-11-06 22:31:17,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:31:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-11-06 22:31:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-06 22:31:17,707 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:17,707 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:17,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:31:17,921 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:17,923 INFO L82 PathProgramCache]: Analyzing trace with hash 240529569, now seen corresponding path program 1 times [2020-11-06 22:31:17,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:17,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925353034] [2020-11-06 22:31:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:31:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:31:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:31:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:31:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:18,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925353034] [2020-11-06 22:31:18,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:18,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-06 22:31:18,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771701887] [2020-11-06 22:31:18,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:31:18,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:31:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:31:18,480 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 19 states. [2020-11-06 22:31:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:20,178 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2020-11-06 22:31:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-06 22:31:20,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2020-11-06 22:31:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:20,182 INFO L225 Difference]: With dead ends: 77 [2020-11-06 22:31:20,182 INFO L226 Difference]: Without dead ends: 68 [2020-11-06 22:31:20,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2020-11-06 22:31:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-06 22:31:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2020-11-06 22:31:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-06 22:31:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-11-06 22:31:20,197 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 50 [2020-11-06 22:31:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:20,197 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-11-06 22:31:20,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:31:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-11-06 22:31:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-06 22:31:20,199 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:20,199 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:20,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:31:20,201 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:20,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1605817482, now seen corresponding path program 1 times [2020-11-06 22:31:20,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:20,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337409695] [2020-11-06 22:31:20,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:31:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:31:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:31:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:31:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-06 22:31:20,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337409695] [2020-11-06 22:31:20,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:31:20,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:31:20,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815493422] [2020-11-06 22:31:20,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:31:20,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:31:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:31:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:31:20,449 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 8 states. [2020-11-06 22:31:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:31:20,757 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2020-11-06 22:31:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:31:20,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2020-11-06 22:31:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:31:20,759 INFO L225 Difference]: With dead ends: 66 [2020-11-06 22:31:20,759 INFO L226 Difference]: Without dead ends: 58 [2020-11-06 22:31:20,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:31:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-06 22:31:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-11-06 22:31:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-06 22:31:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-11-06 22:31:20,773 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 50 [2020-11-06 22:31:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:31:20,773 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-11-06 22:31:20,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:31:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-11-06 22:31:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-06 22:31:20,775 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:31:20,775 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:31:20,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:31:20,775 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:31:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:31:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1099712189, now seen corresponding path program 1 times [2020-11-06 22:31:20,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:31:20,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842290781] [2020-11-06 22:31:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:31:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:31:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:20,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:31:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:31:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:31:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:31:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:21,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:31:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:31:22,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842290781] [2020-11-06 22:31:22,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211522740] [2020-11-06 22:31:22,022 INFO L95 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 [2020-11-06 22:31:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:31:22,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 87 conjunts are in the unsatisfiable core [2020-11-06 22:31:22,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:31:22,473 INFO L382 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 [2020-11-06 22:31:22,474 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:22,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:22,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:31:22,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-11-06 22:31:22,720 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 2=[|v_#memory_int_40|, |v_#memory_int_41|, |v_#memory_int_42|]} [2020-11-06 22:31:22,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:22,931 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2020-11-06 22:31:22,932 INFO L348 Elim1Store]: treesize reduction 139, result has 30.8 percent of original size [2020-11-06 22:31:22,932 INFO L382 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 3 case distinctions, treesize of input 77 treesize of output 69 [2020-11-06 22:31:22,933 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:23,163 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2020-11-06 22:31:23,165 INFO L625 ElimStorePlain]: treesize reduction 16, result has 92.6 percent of original size [2020-11-06 22:31:23,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:31:23,360 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-11-06 22:31:23,361 INFO L348 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2020-11-06 22:31:23,361 INFO L382 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 3 case distinctions, treesize of input 77 treesize of output 108 [2020-11-06 22:31:23,362 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:31:23,655 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2020-11-06 22:31:23,657 INFO L625 ElimStorePlain]: treesize reduction 36, result has 84.4 percent of original size [2020-11-06 22:31:23,664 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:23,816 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-06 22:31:23,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:23,824 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:23,937 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-06 22:31:23,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:23,949 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:24,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:31:24,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,060 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:31:24,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,074 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:31:24,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,088 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,097 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,108 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:31:24,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,118 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-06 22:31:24,118 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:226, output treesize:208 [2020-11-06 22:31:24,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,124 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:31:24,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,131 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:31:24,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,137 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,141 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,146 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-06 22:31:24,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,395 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:31:24,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,402 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:31:24,408 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,417 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:31:24,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-06 22:31:24,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:31:24,427 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:34:13,923 WARN L194 SmtUtils]: Spent 2.78 m on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2020-11-06 22:34:48,885 WARN L194 SmtUtils]: Spent 33.91 s on a formula simplification that was a NOOP. DAG size: 145 [2020-11-06 22:34:48,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 8, 1] term [2020-11-06 22:34:48,925 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-11-06 22:34:48,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 6, 8, 1] term [2020-11-06 22:34:48,947 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-11-06 22:34:48,987 INFO L443 ElimStorePlain]: Different costs {6=[v_prenex_17, v_prenex_16, |v_#memory_int_BEFORE_CALL_4|], 8=[v_prenex_18, v_prenex_20, v_prenex_19]} [2020-11-06 22:34:49,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:34:49,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:34:49,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:34:49,530 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2020-11-06 22:34:49,531 INFO L348 Elim1Store]: treesize reduction 103, result has 58.6 percent of original size [2020-11-06 22:34:49,532 INFO L382 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 2 case distinctions, treesize of input 86 treesize of output 158 [2020-11-06 22:34:49,534 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:34:58,754 WARN L194 SmtUtils]: Spent 9.22 s on a formula simplification. DAG size of input: 181 DAG size of output: 176 [2020-11-06 22:34:58,758 INFO L625 ElimStorePlain]: treesize reduction 69, result has 95.4 percent of original size [2020-11-06 22:34:58,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:34:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:34:58,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:34:59,059 INFO L348 Elim1Store]: treesize reduction 95, result has 43.8 percent of original size [2020-11-06 22:34:59,060 INFO L382 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 2 case distinctions, treesize of input 53 treesize of output 86 [2020-11-06 22:34:59,061 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:35:04,562 WARN L194 SmtUtils]: Spent 5.50 s on a formula simplification. DAG size of input: 181 DAG size of output: 177 [2020-11-06 22:35:04,563 INFO L625 ElimStorePlain]: treesize reduction 22, result has 98.5 percent of original size [2020-11-06 22:35:04,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:04,660 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 28 [2020-11-06 22:35:04,661 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:35:06,313 WARN L194 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:35:06,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:35:06,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:06,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:06,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:06,490 INFO L348 Elim1Store]: treesize reduction 132, result has 47.2 percent of original size [2020-11-06 22:35:06,491 INFO L382 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 3 case distinctions, treesize of input 243 treesize of output 121 [2020-11-06 22:35:06,492 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-06 22:35:08,622 WARN L194 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 167 DAG size of output: 163 [2020-11-06 22:35:08,623 INFO L625 ElimStorePlain]: treesize reduction 26, result has 97.9 percent of original size [2020-11-06 22:35:08,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:08,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:08,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:08,784 INFO L348 Elim1Store]: treesize reduction 116, result has 46.8 percent of original size [2020-11-06 22:35:08,785 INFO L382 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 3 case distinctions, treesize of input 235 treesize of output 105 [2020-11-06 22:35:08,787 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-06 22:35:10,286 WARN L194 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 154 DAG size of output: 150 [2020-11-06 22:35:10,287 INFO L625 ElimStorePlain]: treesize reduction 34, result has 96.9 percent of original size [2020-11-06 22:35:10,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:10,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:10,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:35:10,555 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-11-06 22:35:10,556 INFO L348 Elim1Store]: treesize reduction 530, result has 35.8 percent of original size [2020-11-06 22:35:10,557 INFO L382 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 4 case distinctions, treesize of input 275 treesize of output 299 [2020-11-06 22:35:10,558 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-06 22:35:11,361 WARN L194 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 148 [2020-11-06 22:35:11,362 INFO L625 ElimStorePlain]: treesize reduction 59, result has 94.5 percent of original size [2020-11-06 22:35:11,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:35:11,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:35:11,386 INFO L547 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2020-11-06 22:35:11,387 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 24 variables, input treesize:1417, output treesize:668 [2020-11-06 22:35:11,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:35:11,932 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-06 22:35:11,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:35:12,220 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-11-06 22:35:12,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:35:12,573 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2020-11-06 22:35:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:35:14,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:35:14,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2020-11-06 22:35:14,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327161768] [2020-11-06 22:35:14,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-11-06 22:35:14,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:35:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-11-06 22:35:14,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1773, Unknown=1, NotChecked=0, Total=1892 [2020-11-06 22:35:14,007 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 44 states. [2020-11-06 22:35:15,095 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2020-11-06 22:35:15,394 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2020-11-06 22:35:15,648 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2020-11-06 22:35:15,993 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2020-11-06 22:35:16,455 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-11-06 22:35:18,956 WARN L194 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 116 [2020-11-06 22:36:27,591 WARN L194 SmtUtils]: Spent 1.12 m on a formula simplification. DAG size of input: 195 DAG size of output: 192 [2020-11-06 22:36:32,327 WARN L194 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2020-11-06 22:36:34,776 WARN L194 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2020-11-06 22:36:35,138 WARN L194 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2020-11-06 22:36:35,346 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-11-06 22:36:35,578 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-06 22:36:36,021 WARN L194 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2020-11-06 22:36:36,487 WARN L194 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2020-11-06 22:36:36,993 WARN L194 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2020-11-06 22:36:37,392 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2020-11-06 22:36:37,839 WARN L194 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2020-11-06 22:36:38,298 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:36:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:36:38,580 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2020-11-06 22:36:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-06 22:36:38,581 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2020-11-06 22:36:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:36:38,582 INFO L225 Difference]: With dead ends: 86 [2020-11-06 22:36:38,582 INFO L226 Difference]: Without dead ends: 66 [2020-11-06 22:36:38,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 284.0s TimeCoverageRelationStatistics Valid=543, Invalid=5006, Unknown=1, NotChecked=0, Total=5550 [2020-11-06 22:36:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-06 22:36:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2020-11-06 22:36:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-06 22:36:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-11-06 22:36:38,603 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2020-11-06 22:36:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:36:38,604 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-11-06 22:36:38,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-11-06 22:36:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-11-06 22:36:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-06 22:36:38,605 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:36:38,605 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2020-11-06 22:36:38,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:36:38,822 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:36:38,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:36:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1519530358, now seen corresponding path program 1 times [2020-11-06 22:36:38,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:36:38,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217857422] [2020-11-06 22:36:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:36:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:38,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:36:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:38,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:36:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:38,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:36:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:38,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:36:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:38,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:36:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:36:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:36:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:36:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-06 22:36:39,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217857422] [2020-11-06 22:36:39,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676904960] [2020-11-06 22:36:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:36:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-06 22:36:39,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:36:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:36:39,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:36:39,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2020-11-06 22:36:39,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299002300] [2020-11-06 22:36:39,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:36:39,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:36:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:36:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:36:39,252 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 4 states. [2020-11-06 22:36:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:36:39,273 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2020-11-06 22:36:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:36:39,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2020-11-06 22:36:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:36:39,277 INFO L225 Difference]: With dead ends: 104 [2020-11-06 22:36:39,277 INFO L226 Difference]: Without dead ends: 60 [2020-11-06 22:36:39,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:36:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-06 22:36:39,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-11-06 22:36:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-06 22:36:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-11-06 22:36:39,293 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 56 [2020-11-06 22:36:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:36:39,293 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-11-06 22:36:39,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:36:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-11-06 22:36:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-06 22:36:39,294 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:36:39,294 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:36:39,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:36:39,508 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:36:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:36:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1220105153, now seen corresponding path program 2 times [2020-11-06 22:36:39,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:36:39,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646821397] [2020-11-06 22:36:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:36:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:36:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:36:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:36:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:39,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:36:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:40,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:36:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:40,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:36:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:40,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:36:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:40,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-06 22:36:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:36:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-06 22:36:40,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646821397] [2020-11-06 22:36:40,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137786957] [2020-11-06 22:36:40,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:36:40,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:36:40,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:36:40,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 131 conjunts are in the unsatisfiable core [2020-11-06 22:36:40,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:36:40,817 INFO L382 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 [2020-11-06 22:36:40,818 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:36:40,832 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:36:40,839 INFO L382 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 [2020-11-06 22:36:40,840 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:36:40,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:36:40,852 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:36:40,852 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2020-11-06 22:37:11,383 WARN L194 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-06 22:37:35,539 WARN L194 SmtUtils]: Spent 24.07 s on a formula simplification that was a NOOP. DAG size: 27 [2020-11-06 22:37:35,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:37:59,788 WARN L194 SmtUtils]: Spent 24.06 s on a formula simplification that was a NOOP. DAG size: 27 [2020-11-06 22:37:59,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:38:27,018 WARN L194 SmtUtils]: Spent 27.11 s on a formula simplification. DAG size of input: 50 DAG size of output: 34 [2020-11-06 22:38:27,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 9, 1] term [2020-11-06 22:38:27,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:38:27,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:38:27,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:38:27,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:38:27,054 INFO L382 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 [2020-11-06 22:38:27,055 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:27,137 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:27,146 INFO L382 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 [2020-11-06 22:38:27,147 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:27,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:27,230 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-11-06 22:38:27,230 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:123 [2020-11-06 22:38:29,436 INFO L443 ElimStorePlain]: Different costs {0=[v_prenex_29, v_prenex_28, |v_#memory_$Pointer$.base_BEFORE_CALL_8|, v_prenex_34, |v_#memory_$Pointer$.offset_BEFORE_CALL_8|, |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4|], 2=[v_prenex_32, |v_old(#memory_$Pointer$.offset)_BEFORE_CALL_4|]} [2020-11-06 22:38:29,441 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:29,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:29,517 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:29,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:29,587 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:29,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:29,646 INFO L515 ElimStorePlain]: Eliminatee v_prenex_34 vanished before elimination [2020-11-06 22:38:29,650 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:29,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:29,704 INFO L515 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4| vanished before elimination [2020-11-06 22:38:29,711 INFO L382 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 [2020-11-06 22:38:29,715 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:29,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:29,769 INFO L382 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 [2020-11-06 22:38:29,770 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-06 22:38:29,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:29,826 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:38:29,826 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:115, output treesize:16 [2020-11-06 22:38:34,065 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:38:34,248 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-06 22:38:34,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:34,261 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:38:34,394 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-06 22:38:34,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:34,402 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:38:34,480 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:38:34,482 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-11-06 22:38:34,482 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:229, output treesize:242 [2020-11-06 22:39:17,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:39:17,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:39:17,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:39:17,411 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:39:17,423 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:39:18,138 WARN L194 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:39:18,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:39:18,167 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:39:18,187 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-06 22:39:19,598 WARN L194 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 113 [2020-11-06 22:39:19,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:39:19,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:39:19,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:39:20,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:39:20,777 INFO L244 Elim1Store]: Index analysis took 990 ms [2020-11-06 22:39:22,036 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-11-06 22:39:22,037 INFO L348 Elim1Store]: treesize reduction 190, result has 35.4 percent of original size [2020-11-06 22:39:22,037 INFO L382 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 4 case distinctions, treesize of input 93 treesize of output 107 [2020-11-06 22:39:22,039 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-06 22:39:22,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:39:22,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:39:22,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-06 22:39:22,568 INFO L244 Elim1Store]: Index analysis took 472 ms [2020-11-06 22:39:23,858 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-11-06 22:39:23,859 INFO L348 Elim1Store]: treesize reduction 190, result has 35.4 percent of original size [2020-11-06 22:39:23,860 INFO L382 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 4 case distinctions, treesize of input 93 treesize of output 107 [2020-11-06 22:39:23,861 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-06 22:39:25,320 WARN L194 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 127 [2020-11-06 22:39:25,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:39:25,328 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,330 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,333 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,338 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,344 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,348 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,354 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,358 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,369 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,373 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,380 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,384 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,393 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,397 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,405 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,409 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,417 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2020-11-06 22:39:25,418 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:625, output treesize:685 [2020-11-06 22:39:25,419 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:25,423 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:39,638 WARN L194 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-11-06 22:39:39,644 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:39,650 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-06 22:39:41,718 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< |c_ldv_set_add_#in~s.base| |c_#StackHeapBarrier|)) (.cse0 (not (= (select (select |c_old(#memory_$Pointer$.offset)| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|) |c_ldv_set_add_#in~s.offset|))) (.cse20 (not (= |c_ldv_set_add_#in~s.base| (select (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|)))) (.cse9 (= |c_~#s1~0.offset| 0)) (.cse10 (< |c_#StackHeapBarrier| |c_~#s1~0.base|))) (or (and .cse0 .cse1 (exists ((v_prenex_38 Int) (v_DerPreprocessor_14 Int) (v_DerPreprocessor_12 Int) (v_prenex_36 Int)) (let ((.cse4 (+ |c_ldv_set_add_#in~s.offset| 8)) (.cse6 (+ v_prenex_36 4)) (.cse3 (+ |c_ldv_set_add_#in~s.offset| 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse2 (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| v_DerPreprocessor_12)))) (store .cse5 v_prenex_38 (store (select .cse5 v_prenex_38) .cse6 |c_ldv_set_add_#in~s.base|))))) (store .cse2 |c_ldv_set_add_#in~s.base| (store (store (store (select .cse2 |c_ldv_set_add_#in~s.base|) .cse3 v_prenex_38) .cse4 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| |c_ldv_set_add_#in~s.base|)))) (= |c_#memory_$Pointer$.offset| (let ((.cse7 (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |c_ldv_set_add_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| v_DerPreprocessor_14)))) (store .cse8 v_prenex_38 (store (select .cse8 v_prenex_38) .cse6 .cse3))))) (store .cse7 |c_ldv_set_add_#in~s.base| (store (store (store (select .cse7 |c_ldv_set_add_#in~s.base|) .cse3 v_prenex_36) .cse4 |c_ldv_set_add_#in~s.offset|) |c_ldv_set_add_#in~s.offset| .cse3))))))) .cse9 .cse10) (and (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (__ldv_list_add_~next.base Int) (ldv_set_add_~le~0.offset Int) (__ldv_list_add_~next.offset Int) (ldv_set_add_~le~0.base Int)) (let ((.cse14 (+ ldv_set_add_~le~0.offset 8)) (.cse16 (+ __ldv_list_add_~next.offset 4)) (.cse13 (+ ldv_set_add_~le~0.offset 4))) (and (= (let ((.cse11 (let ((.cse12 (let ((.cse15 (store |c_old(#memory_$Pointer$.base)| ldv_set_add_~le~0.base (store (select |c_old(#memory_$Pointer$.base)| ldv_set_add_~le~0.base) ldv_set_add_~le~0.offset v_DerPreprocessor_11)))) (store .cse15 __ldv_list_add_~next.base (store (select .cse15 __ldv_list_add_~next.base) .cse16 ldv_set_add_~le~0.base))))) (store .cse12 ldv_set_add_~le~0.base (store (store (select .cse12 ldv_set_add_~le~0.base) .cse13 __ldv_list_add_~next.base) .cse14 |c_ldv_set_add_#in~s.base|))))) (store .cse11 |c_ldv_set_add_#in~s.base| (store (select .cse11 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| ldv_set_add_~le~0.base))) |c_#memory_$Pointer$.base|) (< ldv_set_add_~le~0.base |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_old(#memory_$Pointer$.offset)| ldv_set_add_~le~0.base (store (select |c_old(#memory_$Pointer$.offset)| ldv_set_add_~le~0.base) ldv_set_add_~le~0.offset v_DerPreprocessor_13)))) (store .cse19 __ldv_list_add_~next.base (store (select .cse19 __ldv_list_add_~next.base) .cse16 .cse13))))) (store .cse18 ldv_set_add_~le~0.base (store (store (select .cse18 ldv_set_add_~le~0.base) .cse13 __ldv_list_add_~next.offset) .cse14 |c_ldv_set_add_#in~s.offset|))))) (store .cse17 |c_ldv_set_add_#in~s.base| (store (select .cse17 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse13)))) (= (select (select |c_#memory_int| ldv_set_add_~le~0.base) ldv_set_add_~le~0.offset) |c_ldv_set_add_#in~new|)))) .cse20 .cse9 .cse10) (and .cse0 (exists ((v_prenex_37 Int) (v_prenex_35 Int)) (let ((.cse22 (+ v_prenex_35 4)) (.cse23 (+ v_prenex_35 8))) (and (< v_prenex_37 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (let ((.cse21 (store |c_old(#memory_$Pointer$.base)| v_prenex_37 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_37) v_prenex_35 v_prenex_37) .cse22 v_prenex_37) .cse23 |c_ldv_set_add_#in~s.base|)))) (store .cse21 |c_ldv_set_add_#in~s.base| (store (select .cse21 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| v_prenex_37)))) (= |c_#memory_$Pointer$.offset| (let ((.cse24 (store |c_old(#memory_$Pointer$.offset)| v_prenex_37 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_37) v_prenex_35 .cse22) .cse22 (+ v_prenex_35 (- 4))) .cse23 |c_ldv_set_add_#in~s.offset|)))) (store .cse24 |c_ldv_set_add_#in~s.base| (store (select .cse24 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse22))))))) .cse9 .cse10) (and .cse1 .cse20 .cse9 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (__ldv_list_add_~next.base Int) (__ldv_list_add_~next.offset Int)) (let ((.cse27 (+ |c_ldv_set_add_#in~s.offset| 8)) (.cse29 (+ __ldv_list_add_~next.offset 4)) (.cse26 (+ |c_ldv_set_add_#in~s.offset| 4))) (and (= (let ((.cse25 (let ((.cse28 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| v_DerPreprocessor_11)))) (store .cse28 __ldv_list_add_~next.base (store (select .cse28 __ldv_list_add_~next.base) .cse29 |c_ldv_set_add_#in~s.base|))))) (store .cse25 |c_ldv_set_add_#in~s.base| (store (store (store (select .cse25 |c_ldv_set_add_#in~s.base|) .cse26 __ldv_list_add_~next.base) .cse27 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| |c_ldv_set_add_#in~s.base|))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (let ((.cse30 (let ((.cse31 (store |c_old(#memory_$Pointer$.offset)| |c_ldv_set_add_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| v_DerPreprocessor_13)))) (store .cse31 __ldv_list_add_~next.base (store (select .cse31 __ldv_list_add_~next.base) .cse29 .cse26))))) (store .cse30 |c_ldv_set_add_#in~s.base| (store (store (store (select .cse30 |c_ldv_set_add_#in~s.base|) .cse26 __ldv_list_add_~next.offset) .cse27 |c_ldv_set_add_#in~s.offset|) |c_ldv_set_add_#in~s.offset| .cse26))))))) .cse10) (and .cse0 .cse9 (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_DerPreprocessor_14 Int) (v_DerPreprocessor_12 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse35 (+ v_prenex_35 8)) (.cse37 (+ v_prenex_36 4)) (.cse34 (+ v_prenex_35 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse32 (let ((.cse33 (let ((.cse36 (store |c_old(#memory_$Pointer$.base)| v_prenex_37 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_37) v_prenex_35 v_DerPreprocessor_12)))) (store .cse36 v_prenex_38 (store (select .cse36 v_prenex_38) .cse37 v_prenex_37))))) (store .cse33 v_prenex_37 (store (store (select .cse33 v_prenex_37) .cse34 v_prenex_38) .cse35 |c_ldv_set_add_#in~s.base|))))) (store .cse32 |c_ldv_set_add_#in~s.base| (store (select .cse32 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| v_prenex_37)))) (< v_prenex_37 |c_#StackHeapBarrier|) (= (select (select |c_#memory_int| v_prenex_37) v_prenex_35) |c_ldv_set_add_#in~new|) (= |c_#memory_$Pointer$.offset| (let ((.cse38 (let ((.cse39 (let ((.cse40 (store |c_old(#memory_$Pointer$.offset)| v_prenex_37 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_37) v_prenex_35 v_DerPreprocessor_14)))) (store .cse40 v_prenex_38 (store (select .cse40 v_prenex_38) .cse37 .cse34))))) (store .cse39 v_prenex_37 (store (store (select .cse39 v_prenex_37) .cse34 v_prenex_36) .cse35 |c_ldv_set_add_#in~s.offset|))))) (store .cse38 |c_ldv_set_add_#in~s.base| (store (select .cse38 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse34))))))) .cse10) (and (exists ((__ldv_list_add_~next.base Int) (__ldv_list_add_~next.offset Int)) (let ((.cse43 (+ __ldv_list_add_~next.offset 4)) (.cse42 (+ __ldv_list_add_~next.offset 8)) (.cse44 (+ __ldv_list_add_~next.offset 12))) (and (< __ldv_list_add_~next.base |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse41 (store |c_old(#memory_$Pointer$.offset)| __ldv_list_add_~next.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| __ldv_list_add_~next.base) .cse43 .cse42) .cse42 __ldv_list_add_~next.offset) .cse44 |c_ldv_set_add_#in~s.offset|)))) (store .cse41 |c_ldv_set_add_#in~s.base| (store (select .cse41 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse42)))) (= (let ((.cse45 (store |c_old(#memory_$Pointer$.base)| __ldv_list_add_~next.base (store (store (store (select |c_old(#memory_$Pointer$.base)| __ldv_list_add_~next.base) .cse43 __ldv_list_add_~next.base) .cse42 __ldv_list_add_~next.base) .cse44 |c_ldv_set_add_#in~s.base|)))) (store .cse45 |c_ldv_set_add_#in~s.base| (store (select .cse45 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| __ldv_list_add_~next.base))) |c_#memory_$Pointer$.base|)))) .cse20 .cse9 .cse10))) is different from false [2020-11-06 22:39:41,742 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-11-06 22:39:41,775 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-06 22:39:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:39:41,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:39:41,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2020-11-06 22:39:41,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643250529] [2020-11-06 22:39:41,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-11-06 22:39:41,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:39:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-11-06 22:39:41,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1190, Unknown=34, NotChecked=70, Total=1406 [2020-11-06 22:39:41,860 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 38 states. [2020-11-06 22:40:13,946 WARN L194 SmtUtils]: Spent 23.86 s on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-11-06 22:40:50,229 WARN L194 SmtUtils]: Spent 28.10 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-11-06 22:41:28,494 WARN L194 SmtUtils]: Spent 30.15 s on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-11-06 22:42:22,766 WARN L194 SmtUtils]: Spent 31.98 s on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-11-06 22:43:17,192 WARN L194 SmtUtils]: Spent 40.23 s on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2020-11-06 22:43:25,488 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2020-11-06 22:43:37,860 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2020-11-06 22:43:50,216 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2020-11-06 22:44:10,627 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2020-11-06 22:44:22,932 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71