/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_add-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:31:13,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:31:13,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:31:13,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:31:13,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:31:13,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:31:13,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:31:13,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:31:13,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:31:13,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:31:13,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:31:13,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:31:13,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:31:13,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:31:13,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:31:13,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:31:13,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:31:13,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:31:13,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:31:13,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:31:13,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:31:13,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:31:13,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:31:13,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:31:13,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:31:13,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:31:13,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:31:13,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:31:13,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:31:13,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:31:13,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:31:13,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:31:13,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:31:13,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:31:13,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:31:13,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:31:13,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:31:13,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:31:13,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:31:13,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:31:13,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:31:13,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:31:13,843 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:31:13,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:31:13,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:31:13,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:31:13,845 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:31:13,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:31:13,846 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:31:13,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:31:13,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:31:13,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:31:13,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:31:13,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:31:13,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:31:13,847 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:31:13,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:31:13,848 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:31:13,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:31:13,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:31:13,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:31:13,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:31:13,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:31:13,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:31:13,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:31:13,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:31:13,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:31:13,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:31:13,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:31:13,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:31:13,850 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:31:13,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:31:14,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:31:14,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:31:14,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:31:14,314 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:31:14,315 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:31:14,316 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_add-2.i [2020-09-04 13:31:14,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/384943e13/bbb74db6742345ff8f43d8830ba6b55e/FLAGde0533180 [2020-09-04 13:31:15,052 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:31:15,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-sets/test_add-2.i [2020-09-04 13:31:15,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/384943e13/bbb74db6742345ff8f43d8830ba6b55e/FLAGde0533180 [2020-09-04 13:31:15,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/384943e13/bbb74db6742345ff8f43d8830ba6b55e [2020-09-04 13:31:15,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:31:15,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:31:15,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:31:15,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:31:15,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:31:15,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:31:15" (1/1) ... [2020-09-04 13:31:15,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c8d45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:15, skipping insertion in model container [2020-09-04 13:31:15,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:31:15" (1/1) ... [2020-09-04 13:31:15,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:31:15,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:31:15,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:31:15,942 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:31:16,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:31:16,084 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:31:16,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16 WrapperNode [2020-09-04 13:31:16,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:31:16,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:31:16,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:31:16,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:31:16,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... [2020-09-04 13:31:16,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... [2020-09-04 13:31:16,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... [2020-09-04 13:31:16,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... [2020-09-04 13:31:16,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... [2020-09-04 13:31:16,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... [2020-09-04 13:31:16,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... [2020-09-04 13:31:16,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:31:16,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:31:16,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:31:16,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:31:16,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:31:16,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:31:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:31:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-09-04 13:31:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-09-04 13:31:16,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 13:31:16,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-09-04 13:31:16,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2020-09-04 13:31:16,254 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-09-04 13:31:16,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-09-04 13:31:16,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-09-04 13:31:16,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-09-04 13:31:16,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-09-04 13:31:16,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-09-04 13:31:16,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2020-09-04 13:31:16,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_set [2020-09-04 13:31:16,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2020-09-04 13:31:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2020-09-04 13:31:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2020-09-04 13:31:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2020-09-04 13:31:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-09-04 13:31:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:31:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-09-04 13:31:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-09-04 13:31:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-09-04 13:31:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-09-04 13:31:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-09-04 13:31:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-09-04 13:31:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-09-04 13:31:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-09-04 13:31:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-09-04 13:31:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-09-04 13:31:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-09-04 13:31:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-09-04 13:31:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-09-04 13:31:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-09-04 13:31:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-09-04 13:31:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-09-04 13:31:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-09-04 13:31:16,259 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-09-04 13:31:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-09-04 13:31:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-09-04 13:31:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-09-04 13:31:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-09-04 13:31:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-09-04 13:31:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-09-04 13:31:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-09-04 13:31:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-09-04 13:31:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-09-04 13:31:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-09-04 13:31:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-09-04 13:31:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-09-04 13:31:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-09-04 13:31:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-09-04 13:31:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-09-04 13:31:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-09-04 13:31:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-09-04 13:31:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-09-04 13:31:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-09-04 13:31:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-09-04 13:31:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-09-04 13:31:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-09-04 13:31:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-09-04 13:31:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-09-04 13:31:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-09-04 13:31:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-09-04 13:31:16,264 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-09-04 13:31:16,264 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-09-04 13:31:16,264 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-09-04 13:31:16,264 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-09-04 13:31:16,264 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-09-04 13:31:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-09-04 13:31:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-09-04 13:31:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-09-04 13:31:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 13:31:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 13:31:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 13:31:16,265 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 13:31:16,266 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 13:31:16,266 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-09-04 13:31:16,266 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 13:31:16,266 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-09-04 13:31:16,266 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:31:16,266 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-09-04 13:31:16,267 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-09-04 13:31:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 13:31:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-09-04 13:31:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-09-04 13:31:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-09-04 13:31:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-09-04 13:31:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-09-04 13:31:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-09-04 13:31:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-09-04 13:31:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-09-04 13:31:16,270 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-09-04 13:31:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-09-04 13:31:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-09-04 13:31:16,271 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-09-04 13:31:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-09-04 13:31:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-09-04 13:31:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-09-04 13:31:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-09-04 13:31:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-09-04 13:31:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-09-04 13:31:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-09-04 13:31:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-09-04 13:31:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-09-04 13:31:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-09-04 13:31:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-09-04 13:31:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-09-04 13:31:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-09-04 13:31:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-09-04 13:31:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-09-04 13:31:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-09-04 13:31:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-09-04 13:31:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-09-04 13:31:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-09-04 13:31:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-09-04 13:31:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-09-04 13:31:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-09-04 13:31:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-09-04 13:31:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-09-04 13:31:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-09-04 13:31:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-09-04 13:31:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:31:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 13:31:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:31:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-09-04 13:31:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 13:31:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2020-09-04 13:31:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-09-04 13:31:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 13:31:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-09-04 13:31:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-09-04 13:31:16,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-09-04 13:31:16,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 13:31:16,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-09-04 13:31:16,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-09-04 13:31:16,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2020-09-04 13:31:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_set [2020-09-04 13:31:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2020-09-04 13:31:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2020-09-04 13:31:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2020-09-04 13:31:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2020-09-04 13:31:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 13:31:16,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 13:31:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 13:31:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-09-04 13:31:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:31:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:31:16,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 13:31:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-09-04 13:31:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:31:16,948 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:31:16,948 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-09-04 13:31:16,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:31:16 BoogieIcfgContainer [2020-09-04 13:31:16,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:31:16,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:31:16,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:31:16,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:31:16,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:31:15" (1/3) ... [2020-09-04 13:31:16,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470041d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:31:16, skipping insertion in model container [2020-09-04 13:31:16,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:31:16" (2/3) ... [2020-09-04 13:31:16,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470041d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:31:16, skipping insertion in model container [2020-09-04 13:31:16,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:31:16" (3/3) ... [2020-09-04 13:31:16,964 INFO L109 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2020-09-04 13:31:16,975 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:31:16,986 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:31:17,009 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:31:17,041 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:31:17,041 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:31:17,041 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:31:17,041 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:31:17,041 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:31:17,041 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:31:17,041 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:31:17,042 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:31:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-09-04 13:31:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:31:17,071 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:17,073 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] [2020-09-04 13:31:17,073 INFO L427 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1154845074, now seen corresponding path program 1 times [2020-09-04 13:31:17,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:17,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042721724] [2020-09-04 13:31:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:17,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:17,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:31:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:17,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:17,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:31:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:31:17,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042721724] [2020-09-04 13:31:17,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:17,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 13:31:17,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421549697] [2020-09-04 13:31:17,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:31:17,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:31:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 13:31:17,500 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2020-09-04 13:31:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:17,817 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2020-09-04 13:31:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:31:17,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-09-04 13:31:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:17,834 INFO L225 Difference]: With dead ends: 108 [2020-09-04 13:31:17,835 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 13:31:17,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:31:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 13:31:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2020-09-04 13:31:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 13:31:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-09-04 13:31:17,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 28 [2020-09-04 13:31:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:17,947 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-09-04 13:31:17,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:31:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-09-04 13:31:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:31:17,955 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:17,955 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] [2020-09-04 13:31:17,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:31:17,956 INFO L427 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash 221547774, now seen corresponding path program 1 times [2020-09-04 13:31:17,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:17,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697308516] [2020-09-04 13:31:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:31:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:31:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 13:31:18,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697308516] [2020-09-04 13:31:18,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153821334] [2020-09-04 13:31:18,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:31:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2020-09-04 13:31:18,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:18,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:31:18,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2020-09-04 13:31:18,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734347015] [2020-09-04 13:31:18,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:31:18,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:31:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:31:18,402 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2020-09-04 13:31:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:18,428 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2020-09-04 13:31:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:31:18,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-09-04 13:31:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:18,432 INFO L225 Difference]: With dead ends: 64 [2020-09-04 13:31:18,432 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 13:31:18,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:31:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 13:31:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 13:31:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 13:31:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-09-04 13:31:18,448 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 28 [2020-09-04 13:31:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:18,448 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-09-04 13:31:18,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:31:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-09-04 13:31:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:31:18,450 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:18,450 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] [2020-09-04 13:31:18,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-09-04 13:31:18,664 INFO L427 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2088028185, now seen corresponding path program 1 times [2020-09-04 13:31:18,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:18,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372795271] [2020-09-04 13:31:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:31:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:18,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:19,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-09-04 13:31:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:19,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372795271] [2020-09-04 13:31:19,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681926136] [2020-09-04 13:31:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:31:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:19,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 51 conjunts are in the unsatisfiable core [2020-09-04 13:31:19,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:19,268 INFO L384 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-09-04 13:31:19,272 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,283 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:19,287 INFO L384 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-09-04 13:31:19,288 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,295 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:19,295 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:19,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2020-09-04 13:31:19,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:31:19,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:31:19,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2020-09-04 13:31:19,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771889858] [2020-09-04 13:31:19,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:31:19,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:31:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:31:19,470 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-09-04 13:31:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:20,027 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2020-09-04 13:31:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:31:20,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-09-04 13:31:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:20,030 INFO L225 Difference]: With dead ends: 95 [2020-09-04 13:31:20,030 INFO L226 Difference]: Without dead ends: 79 [2020-09-04 13:31:20,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 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-09-04 13:31:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-04 13:31:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2020-09-04 13:31:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 13:31:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2020-09-04 13:31:20,045 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 28 [2020-09-04 13:31:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:20,045 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2020-09-04 13:31:20,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:31:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2020-09-04 13:31:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 13:31:20,047 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:20,047 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] [2020-09-04 13:31:20,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:31:20,263 INFO L427 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 248987231, now seen corresponding path program 1 times [2020-09-04 13:31:20,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:20,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099254154] [2020-09-04 13:31:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:31:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:31:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:31:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:31:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:20,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099254154] [2020-09-04 13:31:20,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:20,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 13:31:20,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33657143] [2020-09-04 13:31:20,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 13:31:20,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 13:31:20,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:31:20,805 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 19 states. [2020-09-04 13:31:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:22,094 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-09-04 13:31:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 13:31:22,095 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2020-09-04 13:31:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:22,096 INFO L225 Difference]: With dead ends: 73 [2020-09-04 13:31:22,097 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 13:31:22,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2020-09-04 13:31:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 13:31:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-09-04 13:31:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 13:31:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-09-04 13:31:22,110 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 48 [2020-09-04 13:31:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:22,110 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-09-04 13:31:22,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 13:31:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-09-04 13:31:22,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 13:31:22,112 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:22,112 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] [2020-09-04 13:31:22,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:31:22,113 INFO L427 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1823590536, now seen corresponding path program 1 times [2020-09-04 13:31:22,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:22,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062026468] [2020-09-04 13:31:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:31:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:31:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:31:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:31:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 13:31:22,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062026468] [2020-09-04 13:31:22,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:31:22,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 13:31:22,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139723426] [2020-09-04 13:31:22,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 13:31:22,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:31:22,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 13:31:22,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:31:22,319 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 8 states. [2020-09-04 13:31:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:31:22,606 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2020-09-04 13:31:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:31:22,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-09-04 13:31:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:31:22,607 INFO L225 Difference]: With dead ends: 62 [2020-09-04 13:31:22,608 INFO L226 Difference]: Without dead ends: 56 [2020-09-04 13:31:22,608 INFO L675 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-09-04 13:31:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-09-04 13:31:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2020-09-04 13:31:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 13:31:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-09-04 13:31:22,627 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 48 [2020-09-04 13:31:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:31:22,629 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-09-04 13:31:22,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 13:31:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-09-04 13:31:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 13:31:22,631 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:31:22,632 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] [2020-09-04 13:31:22,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:31:22,635 INFO L427 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:31:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:31:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -722435370, now seen corresponding path program 1 times [2020-09-04 13:31:22,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:31:22,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800434799] [2020-09-04 13:31:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:31:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:31:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:22,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:31:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:31:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:31:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:31:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:31:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:31:23,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800434799] [2020-09-04 13:31:23,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097447586] [2020-09-04 13:31:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:31:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:31:23,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 90 conjunts are in the unsatisfiable core [2020-09-04 13:31:23,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:31:24,244 INFO L384 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-09-04 13:31:24,244 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:24,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:24,254 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:31:24,254 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2020-09-04 13:31:24,470 INFO L441 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_39|]} [2020-09-04 13:31:24,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:24,679 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2020-09-04 13:31:24,681 INFO L350 Elim1Store]: treesize reduction 139, result has 30.8 percent of original size [2020-09-04 13:31:24,681 INFO L384 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-09-04 13:31:24,682 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:24,926 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2020-09-04 13:31:24,927 INFO L625 ElimStorePlain]: treesize reduction 16, result has 92.6 percent of original size [2020-09-04 13:31:24,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:31:25,139 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-09-04 13:31:25,139 INFO L350 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2020-09-04 13:31:25,140 INFO L384 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-09-04 13:31:25,141 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:31:25,466 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2020-09-04 13:31:25,467 INFO L625 ElimStorePlain]: treesize reduction 36, result has 84.4 percent of original size [2020-09-04 13:31:25,474 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:25,600 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-09-04 13:31:25,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,606 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:25,722 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-09-04 13:31:25,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,726 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:31:25,842 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-09-04 13:31:25,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:31:25,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:25,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:25,854 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:25,864 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:31:25,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:25,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,881 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:25,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,891 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,898 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,907 INFO L545 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-09-04 13:31:25,908 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:226, output treesize:208 [2020-09-04 13:31:25,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:25,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:25,913 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:25,919 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:31:25,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:25,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,929 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:25,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:25,935 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,939 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:25,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:26,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:26,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:26,179 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:26,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:26,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:31:26,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:26,188 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:26,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:26,196 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:26,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:31:26,203 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:31:26,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:26,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:31:26,212 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:34:09,109 WARN L193 SmtUtils]: Spent 2.67 m on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2020-09-04 13:34:41,193 WARN L193 SmtUtils]: Spent 30.84 s on a formula simplification that was a NOOP. DAG size: 145 [2020-09-04 13:34:41,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 8, 1] term [2020-09-04 13:34:41,234 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-09-04 13:34:41,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 6, 8, 1] term [2020-09-04 13:34:41,255 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-09-04 13:34:41,321 INFO L441 ElimStorePlain]: Different costs {6=[v_prenex_18, v_prenex_17, v_prenex_20], 8=[v_prenex_16, |v_#memory_int_BEFORE_CALL_4|, v_prenex_19]} [2020-09-04 13:34:41,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:41,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:41,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:41,541 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2020-09-04 13:34:41,541 INFO L350 Elim1Store]: treesize reduction 95, result has 43.8 percent of original size [2020-09-04 13:34:41,542 INFO L384 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-09-04 13:34:41,543 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:34:50,862 WARN L193 SmtUtils]: Spent 9.32 s on a formula simplification. DAG size of input: 184 DAG size of output: 180 [2020-09-04 13:34:50,864 INFO L625 ElimStorePlain]: treesize reduction 22, result has 98.5 percent of original size [2020-09-04 13:34:50,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:50,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:50,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:51,246 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2020-09-04 13:34:51,247 INFO L350 Elim1Store]: treesize reduction 103, result has 58.6 percent of original size [2020-09-04 13:34:51,247 INFO L384 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-09-04 13:34:51,248 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:34:57,210 WARN L193 SmtUtils]: Spent 5.96 s on a formula simplification. DAG size of input: 185 DAG size of output: 180 [2020-09-04 13:34:57,211 INFO L625 ElimStorePlain]: treesize reduction 69, result has 95.4 percent of original size [2020-09-04 13:34:57,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:57,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:57,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:57,305 INFO L384 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-09-04 13:34:57,305 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:34:59,007 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 169 [2020-09-04 13:34:59,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:34:59,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:59,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:59,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:34:59,173 INFO L350 Elim1Store]: treesize reduction 132, result has 47.2 percent of original size [2020-09-04 13:34:59,174 INFO L384 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-09-04 13:34:59,175 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-04 13:35:01,481 WARN L193 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 170 DAG size of output: 166 [2020-09-04 13:35:01,482 INFO L625 ElimStorePlain]: treesize reduction 26, result has 97.9 percent of original size [2020-09-04 13:35:01,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:35:01,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:35:01,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:35:01,671 INFO L350 Elim1Store]: treesize reduction 116, result has 46.8 percent of original size [2020-09-04 13:35:01,672 INFO L384 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-09-04 13:35:01,673 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-04 13:35:03,154 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 157 DAG size of output: 153 [2020-09-04 13:35:03,155 INFO L625 ElimStorePlain]: treesize reduction 34, result has 96.9 percent of original size [2020-09-04 13:35:03,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:35:03,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:35:03,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:35:03,466 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-09-04 13:35:03,467 INFO L350 Elim1Store]: treesize reduction 530, result has 35.8 percent of original size [2020-09-04 13:35:03,468 INFO L384 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-09-04 13:35:03,470 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-04 13:35:04,328 WARN L193 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2020-09-04 13:35:04,329 INFO L625 ElimStorePlain]: treesize reduction 59, result has 94.6 percent of original size [2020-09-04 13:35:04,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:35:04,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:35:04,357 INFO L545 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-09-04 13:35:04,358 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 24 variables, input treesize:1429, output treesize:680 [2020-09-04 13:35:04,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:35:04,899 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-09-04 13:35:04,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:35:05,245 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-09-04 13:35:05,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:35:05,624 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-09-04 13:35:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:35:07,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:35:07,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2020-09-04 13:35:07,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577806837] [2020-09-04 13:35:07,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-09-04 13:35:07,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:35:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-09-04 13:35:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1767, Unknown=1, NotChecked=0, Total=1892 [2020-09-04 13:35:07,009 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 44 states. [2020-09-04 13:35:07,998 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-09-04 13:35:08,245 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2020-09-04 13:35:08,461 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-09-04 13:35:08,760 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-09-04 13:35:11,833 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2020-09-04 13:36:12,514 WARN L193 SmtUtils]: Spent 59.52 s on a formula simplification. DAG size of input: 183 DAG size of output: 179 [2020-09-04 13:36:16,439 WARN L193 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-09-04 13:36:18,252 WARN L193 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-09-04 13:36:18,586 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-09-04 13:36:18,775 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-09-04 13:36:19,135 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-09-04 13:36:19,564 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2020-09-04 13:36:20,031 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2020-09-04 13:36:20,478 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2020-09-04 13:36:20,883 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2020-09-04 13:36:21,310 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2020-09-04 13:36:21,898 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2020-09-04 13:36:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:36:22,015 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2020-09-04 13:36:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-04 13:36:22,016 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 51 [2020-09-04 13:36:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:36:22,018 INFO L225 Difference]: With dead ends: 82 [2020-09-04 13:36:22,018 INFO L226 Difference]: Without dead ends: 64 [2020-09-04 13:36:22,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 266.5s TimeCoverageRelationStatistics Valid=523, Invalid=4878, Unknown=1, NotChecked=0, Total=5402 [2020-09-04 13:36:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-09-04 13:36:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-09-04 13:36:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 13:36:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-09-04 13:36:22,041 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 51 [2020-09-04 13:36:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:36:22,041 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-09-04 13:36:22,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-09-04 13:36:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-09-04 13:36:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 13:36:22,044 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:36:22,044 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] [2020-09-04 13:36:22,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:36:22,249 INFO L427 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:36:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:36:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1645559976, now seen corresponding path program 1 times [2020-09-04 13:36:22,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:36:22,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465793005] [2020-09-04 13:36:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:36:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:36:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:36:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:36:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:36:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:36:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:36:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:36:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:36:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 13:36:22,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465793005] [2020-09-04 13:36:22,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461696742] [2020-09-04 13:36:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:36:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:22,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:36:22,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:36:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:36:22,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:36:22,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2020-09-04 13:36:22,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330370083] [2020-09-04 13:36:22,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 13:36:22,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:36:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 13:36:22,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 13:36:22,600 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 4 states. [2020-09-04 13:36:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:36:22,619 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2020-09-04 13:36:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 13:36:22,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-09-04 13:36:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:36:22,624 INFO L225 Difference]: With dead ends: 100 [2020-09-04 13:36:22,624 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 13:36:22,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 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-09-04 13:36:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 13:36:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 13:36:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 13:36:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 13:36:22,646 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2020-09-04 13:36:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:36:22,646 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 13:36:22,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 13:36:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 13:36:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-09-04 13:36:22,651 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:36:22,651 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] [2020-09-04 13:36:22,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:36:22,869 INFO L427 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:36:22,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:36:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2009341904, now seen corresponding path program 2 times [2020-09-04 13:36:22,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:36:22,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074659628] [2020-09-04 13:36:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:36:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:36:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:36:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:36:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:36:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:36:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:36:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:36:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 13:36:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:36:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 13:36:23,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074659628] [2020-09-04 13:36:23,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298986342] [2020-09-04 13:36:23,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:36:23,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:36:23,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:36:23,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 121 conjunts are in the unsatisfiable core [2020-09-04 13:36:23,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:36:23,859 INFO L384 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-09-04 13:36:23,860 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:36:23,867 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:36:23,867 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:36:23,868 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2020-09-04 13:36:24,137 INFO L384 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-09-04 13:36:24,138 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:36:24,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:36:24,156 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:36:24,156 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2020-09-04 13:36:24,225 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:36:24,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:36:24,245 INFO L513 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4| vanished before elimination [2020-09-04 13:36:24,246 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:36:24,247 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:13 [2020-09-04 13:36:24,384 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_42|], 2=[|v_#memory_int_44|, |v_#memory_int_45|, |v_#memory_int_46|]} [2020-09-04 13:36:24,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:36:24,655 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-09-04 13:36:24,658 INFO L350 Elim1Store]: treesize reduction 100, result has 50.2 percent of original size [2020-09-04 13:36:24,659 INFO L384 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-09-04 13:36:24,659 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:36:25,173 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2020-09-04 13:36:25,174 INFO L625 ElimStorePlain]: treesize reduction 36, result has 86.1 percent of original size [2020-09-04 13:36:25,182 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:36:25,431 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-09-04 13:36:25,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:36:25,438 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:36:25,634 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-09-04 13:36:25,636 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:36:25,643 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:36:25,844 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-09-04 13:36:25,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-04 13:36:25,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:36:25,847 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:36:25,849 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-09-04 13:36:25,849 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:229, output treesize:236 [2020-09-04 13:36:25,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:36:25,851 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:36:26,085 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:36:26,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:37:21,696 WARN L193 SmtUtils]: Spent 51.52 s on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2020-09-04 13:37:43,650 WARN L193 SmtUtils]: Spent 12.77 s on a formula simplification that was a NOOP. DAG size: 176 [2020-09-04 13:37:43,673 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-09-04 13:37:43,701 INFO L441 ElimStorePlain]: Different costs {100=[|v_#memory_int_BEFORE_CALL_8|], 130=[|v_#memory_$Pointer$.base_BEFORE_CALL_11|]} [2020-09-04 13:37:45,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:37:47,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:37:48,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:37:50,534 INFO L244 Elim1Store]: Index analysis took 5315 ms [2020-09-04 13:38:02,147 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-09-04 13:38:02,148 INFO L350 Elim1Store]: treesize reduction 116, result has 46.8 percent of original size [2020-09-04 13:38:02,149 INFO L384 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 109 treesize of output 105 [2020-09-04 13:38:02,150 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:38:05,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:06,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:06,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:08,246 INFO L244 Elim1Store]: Index analysis took 4766 ms [2020-09-04 13:38:15,639 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2020-09-04 13:38:15,640 INFO L350 Elim1Store]: treesize reduction 95, result has 58.5 percent of original size [2020-09-04 13:38:15,641 INFO L384 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 78 treesize of output 146 [2020-09-04 13:38:15,642 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-09-04 13:38:17,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:18,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:18,969 INFO L244 Elim1Store]: Index analysis took 2149 ms [2020-09-04 13:38:25,000 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2020-09-04 13:38:25,001 INFO L350 Elim1Store]: treesize reduction 127, result has 43.6 percent of original size [2020-09-04 13:38:25,002 INFO L384 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 69 treesize of output 110 [2020-09-04 13:38:25,003 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-09-04 13:38:25,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:25,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:25,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:25,544 INFO L244 Elim1Store]: Index analysis took 374 ms [2020-09-04 13:38:25,727 INFO L384 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 66 treesize of output 26 [2020-09-04 13:38:25,728 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-09-04 13:38:26,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:27,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:28,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:29,248 INFO L244 Elim1Store]: Index analysis took 2815 ms [2020-09-04 13:38:33,742 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-09-04 13:38:33,743 INFO L350 Elim1Store]: treesize reduction 116, result has 46.8 percent of original size [2020-09-04 13:38:33,744 INFO L384 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 91 treesize of output 105 [2020-09-04 13:38:33,745 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-09-04 13:38:35,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:35,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:36,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:38:36,555 INFO L244 Elim1Store]: Index analysis took 2132 ms [2020-09-04 13:38:39,597 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-09-04 13:38:39,598 INFO L350 Elim1Store]: treesize reduction 362, result has 35.6 percent of original size [2020-09-04 13:38:39,598 INFO L384 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 175 treesize of output 203 [2020-09-04 13:38:39,599 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-09-04 13:40:09,066 WARN L193 SmtUtils]: Spent 1.49 m on a formula simplification. DAG size of input: 233 DAG size of output: 216 [2020-09-04 13:40:09,067 INFO L625 ElimStorePlain]: treesize reduction 184, result has 88.8 percent of original size [2020-09-04 13:40:09,213 INFO L545 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:40:09,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:09,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:09,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:09,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:09,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:09,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:09,357 INFO L545 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:40:09,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:09,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:09,569 INFO L545 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:40:09,815 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:40:09,815 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:40:09,816 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:40:09,818 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:40:09,819 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:40:09,820 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:40:09,821 INFO L545 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:40:10,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:10,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:10,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:10,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:10,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:10,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-09-04 13:40:10,053 INFO L545 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-04 13:40:10,184 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:40:10,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:10,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:10,187 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-04 13:40:10,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:10,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-04 13:40:10,189 INFO L545 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-04 13:43:08,736 WARN L193 SmtUtils]: Spent 2.98 m on a formula simplification. DAG size of input: 262 DAG size of output: 258 [2020-09-04 13:43:08,738 INFO L625 ElimStorePlain]: treesize reduction 90, result has 96.5 percent of original size [2020-09-04 13:43:08,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:43:08,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:43:08,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:43:08,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:43:08,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:43:08,767 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:43:08,768 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:43:08,770 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:43:08,772 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:43:08,775 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:43:08,777 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:43:08,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:43:08,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:43:08,787 INFO L545 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2020-09-04 13:43:08,787 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 19 variables, input treesize:1559, output treesize:2022 [2020-09-04 13:43:08,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:43:08,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:43:08,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:43:08,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:43:08,793 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:44:56,647 WARN L193 SmtUtils]: Spent 1.46 m on a formula simplification that was a NOOP. DAG size: 217 [2020-09-04 13:44:56,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:44:56,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:44:56,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-04 13:44:56,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-04 13:44:56,661 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-04 13:44:58,703 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse69 (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|))) (let ((.cse91 (select .cse69 |c_ldv_set_add_#in~s.offset|))) (let ((.cse92 (+ |c_ldv_set_add_#in~s.offset| 4)) (.cse70 (+ .cse91 4)) (.cse76 (select |c_#memory_int| |c_ldv_set_add_#in~s.base|)) (.cse77 (+ |c_ldv_set_add_#in~s.offset| (- 4)))) (let ((.cse24 (select .cse69 .cse77)) (.cse27 (= |c_ldv_set_add_#in~new| (select .cse76 (+ |c_ldv_set_add_#in~s.offset| (- 8))))) (.cse26 (= .cse70 |c_ldv_set_add_#in~s.offset|)) (.cse46 (= (select .cse69 .cse92) |c_ldv_set_add_#in~s.offset|)) (.cse25 (<= (+ |c_ldv_set_add_#in~s.base| 1) |c_#StackHeapBarrier|)) (.cse52 (= .cse91 |c_ldv_set_add_#in~s.offset|)) (.cse6 (= .cse91 .cse92)) (.cse7 (= |c_~#s1~0.offset| 0)) (.cse8 (< |c_#StackHeapBarrier| |c_~#s1~0.base|))) (or (and (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_10 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_10 (store (select |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_10) (+ .cse3 (- 4)) v_DerPreprocessor_11)))) (let ((.cse1 (select (select .cse2 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse4 (+ .cse3 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store .cse2 .cse1 (store (store (select .cse2 .cse1) .cse3 .cse1) .cse4 |c_ldv_set_add_#in~s.base|)))) (store .cse0 |c_ldv_set_add_#in~s.base| (store (select .cse0 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse1)))) (= v_DerPreprocessor_10 .cse1) (= (+ (select .cse5 .cse3) 4) .cse3) (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= (select .cse5 .cse4) |c_ldv_set_add_#in~s.offset|) (= .cse1 |c_ldv_set_add_#in~s.base|))))))) .cse6 .cse7 .cse8) (and (exists ((v_DerPreprocessor_12 Int) (ldv_set_add_~le~0.base Int)) (let ((.cse16 (select |c_#memory_$Pointer$.offset| ldv_set_add_~le~0.base)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse17 (select .cse16 .cse11)) (.cse14 (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) (+ .cse11 (- 4)) v_DerPreprocessor_12)))) (let ((.cse13 (+ .cse11 4)) (.cse12 (select (select .cse14 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|)) (.cse15 (+ .cse17 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse9 (let ((.cse10 (store .cse14 .cse12 (store (select .cse14 .cse12) .cse15 ldv_set_add_~le~0.base)))) (store .cse10 ldv_set_add_~le~0.base (store (store (select .cse10 ldv_set_add_~le~0.base) .cse11 .cse12) .cse13 |c_ldv_set_add_#in~s.base|))))) (store .cse9 |c_ldv_set_add_#in~s.base| (store (select .cse9 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| ldv_set_add_~le~0.base)))) (= ldv_set_add_~le~0.base .cse12) (= (select .cse16 .cse13) |c_ldv_set_add_#in~s.offset|) (= (+ .cse17 8) .cse11) (= (select (select |c_#memory_$Pointer$.offset| .cse12) .cse15) .cse11) (<= (+ ldv_set_add_~le~0.base 1) |c_#StackHeapBarrier|)))))) .cse7 .cse8) (and (exists ((v_DerPreprocessor_9 Int)) (let ((.cse21 (+ |c_ldv_set_add_#in~s.offset| (- 4))) (.cse23 (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) (+ |c_ldv_set_add_#in~s.offset| (- 8)) v_DerPreprocessor_9))) (let ((.cse18 (select .cse23 |c_ldv_set_add_#in~s.offset|)) (.cse19 (+ (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) .cse21) 4))) (and (= (+ (select (select |c_#memory_$Pointer$.offset| .cse18) .cse19) 4) |c_ldv_set_add_#in~s.offset|) (= .cse18 |c_ldv_set_add_#in~s.base|) (= (let ((.cse20 (let ((.cse22 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| .cse23))) (store .cse22 .cse18 (store (select .cse22 .cse18) .cse19 |c_ldv_set_add_#in~s.base|))))) (store .cse20 |c_ldv_set_add_#in~s.base| (store (store (select .cse20 |c_ldv_set_add_#in~s.base|) .cse21 .cse18) |c_ldv_set_add_#in~s.offset| |c_ldv_set_add_#in~s.base|))) |c_#memory_$Pointer$.base|))))) (= (+ .cse24 12) |c_ldv_set_add_#in~s.offset|) .cse25 .cse26 .cse7 .cse8) (and .cse27 (= (+ .cse24 8) |c_ldv_set_add_#in~s.offset|) (exists ((v_DerPreprocessor_8 Int)) (let ((.cse32 (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) (+ |c_ldv_set_add_#in~s.offset| (- 8)) v_DerPreprocessor_8))) (let ((.cse28 (select .cse32 |c_ldv_set_add_#in~s.offset|))) (and (= .cse28 |c_ldv_set_add_#in~s.base|) (= |c_#memory_$Pointer$.base| (let ((.cse30 (+ |c_ldv_set_add_#in~s.offset| (- 4)))) (let ((.cse29 (let ((.cse31 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| .cse32))) (store .cse31 .cse28 (store (select .cse31 .cse28) .cse30 |c_ldv_set_add_#in~s.base|))))) (store .cse29 |c_ldv_set_add_#in~s.base| (store (store (select .cse29 |c_ldv_set_add_#in~s.base|) .cse30 .cse28) |c_ldv_set_add_#in~s.offset| |c_ldv_set_add_#in~s.base|))))))))) .cse25 .cse26 .cse7 .cse8) (and .cse27 (exists ((v_DerPreprocessor_9 Int)) (let ((.cse36 (+ |c_ldv_set_add_#in~s.offset| (- 4))) (.cse38 (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) (+ |c_ldv_set_add_#in~s.offset| (- 8)) v_DerPreprocessor_9))) (let ((.cse33 (select .cse38 |c_ldv_set_add_#in~s.offset|)) (.cse34 (+ (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) .cse36) 4))) (and (= (+ (select (select |c_#memory_$Pointer$.offset| .cse33) .cse34) 4) |c_ldv_set_add_#in~s.offset|) (= (let ((.cse35 (let ((.cse37 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| .cse38))) (store .cse37 .cse33 (store (select .cse37 .cse33) .cse34 |c_ldv_set_add_#in~s.base|))))) (store .cse35 |c_ldv_set_add_#in~s.base| (store (store (select .cse35 |c_ldv_set_add_#in~s.base|) .cse36 .cse33) |c_ldv_set_add_#in~s.offset| |c_ldv_set_add_#in~s.base|))) |c_#memory_$Pointer$.base|))))) .cse25 .cse26 .cse7 .cse8) (and (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int)) (let ((.cse39 (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse42 (+ .cse39 (- 4)))) (let ((.cse44 (store |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_13 (store (select |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_13) .cse42 v_DerPreprocessor_14)))) (let ((.cse41 (select (select .cse44 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse40 (select |c_#memory_$Pointer$.offset| .cse41)) (.cse45 (+ .cse39 4))) (and (= .cse39 (select .cse40 .cse39)) (= (select (select |c_#memory_int| .cse41) .cse42) |c_ldv_set_add_#in~new|) (= |c_#memory_$Pointer$.base| (let ((.cse43 (store .cse44 .cse41 (store (store (store (select .cse44 .cse41) .cse45 .cse41) .cse39 .cse41) .cse45 |c_ldv_set_add_#in~s.base|)))) (store .cse43 |c_ldv_set_add_#in~s.base| (store (select .cse43 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse41)))) (<= (+ .cse41 1) |c_#StackHeapBarrier|) (= .cse41 v_DerPreprocessor_13) (= (select .cse40 .cse45) |c_ldv_set_add_#in~s.offset|)))))))) .cse7 .cse8) (and .cse46 (exists ((v_DerPreprocessor_15 Int)) (let ((.cse50 (+ |c_ldv_set_add_#in~s.offset| (- 4)))) (let ((.cse51 (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) .cse50 v_DerPreprocessor_15))) (let ((.cse48 (select .cse51 |c_ldv_set_add_#in~s.offset|))) (and (= (let ((.cse47 (let ((.cse49 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| .cse51))) (store .cse49 .cse48 (store (select .cse49 .cse48) .cse50 |c_ldv_set_add_#in~s.base|))))) (store .cse47 |c_ldv_set_add_#in~s.base| (store (store (store (select .cse47 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse48) (+ |c_ldv_set_add_#in~s.offset| 4) |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|) (= (select (select |c_#memory_$Pointer$.offset| .cse48) .cse50) |c_ldv_set_add_#in~s.offset|) (= .cse48 |c_ldv_set_add_#in~s.base|)))))) .cse25 .cse7 .cse52 .cse8) (and .cse7 (exists ((v_DerPreprocessor_12 Int) (ldv_set_add_~le~0.base Int)) (let ((.cse55 (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse61 (+ .cse55 (- 4)))) (let ((.cse60 (select |c_#memory_$Pointer$.offset| ldv_set_add_~le~0.base)) (.cse58 (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) .cse61 v_DerPreprocessor_12)))) (let ((.cse57 (+ .cse55 4)) (.cse56 (select (select .cse58 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|)) (.cse59 (+ (select .cse60 .cse55) 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse53 (let ((.cse54 (store .cse58 .cse56 (store (select .cse58 .cse56) .cse59 ldv_set_add_~le~0.base)))) (store .cse54 ldv_set_add_~le~0.base (store (store (select .cse54 ldv_set_add_~le~0.base) .cse55 .cse56) .cse57 |c_ldv_set_add_#in~s.base|))))) (store .cse53 |c_ldv_set_add_#in~s.base| (store (select .cse53 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| ldv_set_add_~le~0.base)))) (= (select .cse60 .cse57) |c_ldv_set_add_#in~s.offset|) (= (select (select |c_#memory_int| ldv_set_add_~le~0.base) .cse61) |c_ldv_set_add_#in~new|) (= (select (select |c_#memory_$Pointer$.offset| .cse56) .cse59) .cse55) (<= (+ ldv_set_add_~le~0.base 1) |c_#StackHeapBarrier|))))))) .cse8) (and (exists ((v_DerPreprocessor_12 Int)) (let ((.cse68 (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|))) (let ((.cse62 (select .cse68 |c_ldv_set_add_#in~s.offset|))) (let ((.cse67 (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) (+ .cse62 (- 4)) v_DerPreprocessor_12))) (let ((.cse63 (select .cse67 |c_ldv_set_add_#in~s.offset|)) (.cse64 (+ (select .cse68 .cse62) 4))) (and (= .cse62 (select (select |c_#memory_$Pointer$.offset| .cse63) .cse64)) (= (let ((.cse65 (let ((.cse66 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| .cse67))) (store .cse66 .cse63 (store (select .cse66 .cse63) .cse64 |c_ldv_set_add_#in~s.base|))))) (store .cse65 |c_ldv_set_add_#in~s.base| (store (store (store (select .cse65 |c_ldv_set_add_#in~s.base|) .cse62 .cse63) (+ .cse62 4) |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|))))))) (= (select .cse69 .cse70) |c_ldv_set_add_#in~s.offset|) .cse6 .cse25 .cse7 .cse8) (and (exists ((v_DerPreprocessor_15 Int) (__ldv_list_add_~next.offset Int)) (let ((.cse75 (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base|) (+ |c_ldv_set_add_#in~s.offset| (- 4)) v_DerPreprocessor_15))) (let ((.cse71 (select .cse75 |c_ldv_set_add_#in~s.offset|)) (.cse72 (+ __ldv_list_add_~next.offset 4))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse71) .cse72) |c_ldv_set_add_#in~s.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse73 (let ((.cse74 (store |c_old(#memory_$Pointer$.base)| |c_ldv_set_add_#in~s.base| .cse75))) (store .cse74 .cse71 (store (select .cse74 .cse71) .cse72 |c_ldv_set_add_#in~s.base|))))) (store .cse73 |c_ldv_set_add_#in~s.base| (store (store (store (select .cse73 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse71) (+ |c_ldv_set_add_#in~s.offset| 4) |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| |c_ldv_set_add_#in~s.base|)))))))) .cse46 .cse25 (= (select .cse76 .cse77) |c_ldv_set_add_#in~new|) .cse7 .cse52 .cse8) (and (exists ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_10 Int)) (let ((.cse82 (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse79 (+ .cse82 (- 4)))) (let ((.cse81 (store |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_10 (store (select |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_10) .cse79 v_DerPreprocessor_11)))) (let ((.cse78 (select (select .cse81 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse84 (select |c_#memory_$Pointer$.offset| .cse78)) (.cse83 (+ .cse82 4))) (and (= |c_ldv_set_add_#in~new| (select (select |c_#memory_int| .cse78) .cse79)) (= |c_#memory_$Pointer$.base| (let ((.cse80 (store .cse81 .cse78 (store (store (select .cse81 .cse78) .cse82 .cse78) .cse83 |c_ldv_set_add_#in~s.base|)))) (store .cse80 |c_ldv_set_add_#in~s.base| (store (select .cse80 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse78)))) (= v_DerPreprocessor_10 .cse78) (= (+ (select .cse84 .cse82) 4) .cse82) (<= (+ .cse78 1) |c_#StackHeapBarrier|) (= (select .cse84 .cse83) |c_ldv_set_add_#in~s.offset|)))))))) .cse7 .cse8) (and (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int)) (let ((.cse85 (select (select |c_#memory_$Pointer$.offset| |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse89 (store |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_13 (store (select |c_old(#memory_$Pointer$.base)| v_DerPreprocessor_13) (+ .cse85 (- 4)) v_DerPreprocessor_14)))) (let ((.cse88 (select (select .cse89 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset|))) (let ((.cse86 (select |c_#memory_$Pointer$.offset| .cse88)) (.cse90 (+ .cse85 4))) (and (= .cse85 (select .cse86 .cse85)) (= |c_#memory_$Pointer$.base| (let ((.cse87 (store .cse89 .cse88 (store (store (store (select .cse89 .cse88) .cse90 .cse88) .cse85 .cse88) .cse90 |c_ldv_set_add_#in~s.base|)))) (store .cse87 |c_ldv_set_add_#in~s.base| (store (select .cse87 |c_ldv_set_add_#in~s.base|) |c_ldv_set_add_#in~s.offset| .cse88)))) (<= (+ .cse88 1) |c_#StackHeapBarrier|) (= .cse88 v_DerPreprocessor_13) (= (select .cse86 .cse90) |c_ldv_set_add_#in~s.offset|) (= .cse88 |c_ldv_set_add_#in~s.base|))))))) .cse6 .cse7 .cse8)))))) is different from false [2020-09-04 13:44:58,726 INFO L603 QuantifierPusher]: Distributing 12 conjuncts over 2 disjuncts [2020-09-04 13:44:58,740 INFO L603 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-09-04 13:44:59,129 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-09-04 13:44:59,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:44:59,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:44:59,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:44:59,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:44:59,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-09-04 13:44:59,669 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-09-04 13:44:59,671 INFO L350 Elim1Store]: treesize reduction 148, result has 55.2 percent of original size [2020-09-04 13:44:59,671 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 240 [2020-09-04 13:44:59,674 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-04 13:44:59,875 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-09-04 13:44:59,876 INFO L625 ElimStorePlain]: treesize reduction 151, result has 43.7 percent of original size [2020-09-04 13:44:59,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-09-04 13:44:59,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:498, output treesize:129 [2020-09-04 13:45:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 13:45:08,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:45:08,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 34 [2020-09-04 13:45:08,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391582211] [2020-09-04 13:45:08,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-09-04 13:45:08,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:45:08,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-09-04 13:45:08,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=959, Unknown=8, NotChecked=62, Total=1122 [2020-09-04 13:45:08,180 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 34 states. [2020-09-04 13:45:11,318 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-09-04 13:45:11,964 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-09-04 13:45:12,451 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-09-04 13:45:12,938 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-09-04 13:45:13,534 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-09-04 13:45:14,129 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2020-09-04 13:45:14,874 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-09-04 13:45:15,400 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-09-04 13:45:16,624 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-09-04 13:45:17,497 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-09-04 13:45:18,010 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-09-04 13:45:22,516 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-09-04 13:45:25,066 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-09-04 13:45:30,717 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 90