/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 20:38:16,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 20:38:16,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 20:38:16,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 20:38:16,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 20:38:16,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 20:38:16,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 20:38:16,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 20:38:16,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 20:38:16,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 20:38:16,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 20:38:16,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 20:38:16,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 20:38:16,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 20:38:16,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 20:38:16,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 20:38:16,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 20:38:16,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 20:38:16,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 20:38:16,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 20:38:16,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 20:38:16,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 20:38:16,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 20:38:16,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 20:38:16,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 20:38:16,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 20:38:16,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 20:38:16,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 20:38:16,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 20:38:16,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 20:38:16,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 20:38:16,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 20:38:16,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 20:38:16,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 20:38:16,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 20:38:16,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 20:38:16,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 20:38:16,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 20:38:16,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 20:38:16,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 20:38:16,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 20:38:16,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-21 20:38:16,207 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 20:38:16,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 20:38:16,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 20:38:16,212 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 20:38:16,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 20:38:16,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 20:38:16,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 20:38:16,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 20:38:16,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 20:38:16,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 20:38:16,215 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 20:38:16,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 20:38:16,215 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 20:38:16,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 20:38:16,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 20:38:16,216 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 20:38:16,217 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 20:38:16,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 20:38:16,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:38:16,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 20:38:16,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 20:38:16,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 20:38:16,218 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-02-21 20:38:16,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 20:38:16,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 20:38:16,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 20:38:16,676 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 20:38:16,677 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 20:38:16,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2021-02-21 20:38:16,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed909069/06bfd965acb34045aa422a0f2692e7f6/FLAGcad2f4b76 [2021-02-21 20:38:17,592 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 20:38:17,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2021-02-21 20:38:17,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed909069/06bfd965acb34045aa422a0f2692e7f6/FLAGcad2f4b76 [2021-02-21 20:38:17,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed909069/06bfd965acb34045aa422a0f2692e7f6 [2021-02-21 20:38:17,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 20:38:17,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 20:38:17,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 20:38:17,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 20:38:17,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 20:38:17,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:38:17" (1/1) ... [2021-02-21 20:38:17,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e92bf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:17, skipping insertion in model container [2021-02-21 20:38:17,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:38:17" (1/1) ... [2021-02-21 20:38:17,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 20:38:17,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 20:38:18,057 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2021-02-21 20:38:18,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:38:18,300 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 20:38:18,312 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i[292,305] [2021-02-21 20:38:18,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:38:18,418 INFO L208 MainTranslator]: Completed translation [2021-02-21 20:38:18,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18 WrapperNode [2021-02-21 20:38:18,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 20:38:18,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 20:38:18,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 20:38:18,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 20:38:18,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... [2021-02-21 20:38:18,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... [2021-02-21 20:38:18,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... [2021-02-21 20:38:18,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... [2021-02-21 20:38:18,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... [2021-02-21 20:38:18,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... [2021-02-21 20:38:18,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... [2021-02-21 20:38:18,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 20:38:18,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 20:38:18,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 20:38:18,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 20:38:18,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:38:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 20:38:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 20:38:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 20:38:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2021-02-21 20:38:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-02-21 20:38:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-02-21 20:38:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-02-21 20:38:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-02-21 20:38:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-02-21 20:38:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2021-02-21 20:38:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2021-02-21 20:38:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-02-21 20:38:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-02-21 20:38:18,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 20:38:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 20:38:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 20:38:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 20:38:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 20:38:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2021-02-21 20:38:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-02-21 20:38:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-02-21 20:38:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-02-21 20:38:18,696 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-02-21 20:38:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-02-21 20:38:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-02-21 20:38:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-02-21 20:38:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-02-21 20:38:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-02-21 20:38:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-02-21 20:38:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-02-21 20:38:18,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-02-21 20:38:18,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-02-21 20:38:18,698 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-02-21 20:38:18,698 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-02-21 20:38:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-02-21 20:38:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-02-21 20:38:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-02-21 20:38:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-02-21 20:38:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-02-21 20:38:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-02-21 20:38:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-02-21 20:38:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-02-21 20:38:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-02-21 20:38:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-02-21 20:38:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-02-21 20:38:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-02-21 20:38:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-02-21 20:38:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-02-21 20:38:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-02-21 20:38:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-02-21 20:38:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-02-21 20:38:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-02-21 20:38:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-02-21 20:38:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-02-21 20:38:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-02-21 20:38:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-02-21 20:38:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-02-21 20:38:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-02-21 20:38:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-02-21 20:38:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-02-21 20:38:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-02-21 20:38:18,703 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-02-21 20:38:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-02-21 20:38:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-02-21 20:38:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-02-21 20:38:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-02-21 20:38:18,704 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-02-21 20:38:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-02-21 20:38:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-02-21 20:38:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-02-21 20:38:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-02-21 20:38:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-02-21 20:38:18,705 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-02-21 20:38:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-02-21 20:38:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-02-21 20:38:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-21 20:38:18,706 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-02-21 20:38:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-21 20:38:18,707 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-02-21 20:38:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-02-21 20:38:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-02-21 20:38:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-02-21 20:38:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-02-21 20:38:18,708 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-02-21 20:38:18,710 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-02-21 20:38:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-02-21 20:38:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-02-21 20:38:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-02-21 20:38:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-02-21 20:38:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-02-21 20:38:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-02-21 20:38:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-02-21 20:38:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-02-21 20:38:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-02-21 20:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-02-21 20:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-02-21 20:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-02-21 20:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-02-21 20:38:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-02-21 20:38:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-02-21 20:38:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-02-21 20:38:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-02-21 20:38:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-02-21 20:38:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-02-21 20:38:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-02-21 20:38:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-02-21 20:38:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-02-21 20:38:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-02-21 20:38:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-02-21 20:38:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-02-21 20:38:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-02-21 20:38:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-02-21 20:38:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-02-21 20:38:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-02-21 20:38:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-02-21 20:38:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-02-21 20:38:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-02-21 20:38:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-02-21 20:38:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-02-21 20:38:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-02-21 20:38:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-02-21 20:38:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-02-21 20:38:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-02-21 20:38:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-02-21 20:38:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-02-21 20:38:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 20:38:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2021-02-21 20:38:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2021-02-21 20:38:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-02-21 20:38:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-02-21 20:38:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 20:38:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 20:38:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 20:38:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-02-21 20:38:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 20:38:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 20:38:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 20:38:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-02-21 20:38:18,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-02-21 20:38:18,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 20:38:19,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 20:38:19,356 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-21 20:38:19,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:38:19 BoogieIcfgContainer [2021-02-21 20:38:19,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 20:38:19,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 20:38:19,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 20:38:19,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 20:38:19,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 08:38:17" (1/3) ... [2021-02-21 20:38:19,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c8068b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:38:19, skipping insertion in model container [2021-02-21 20:38:19,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:38:18" (2/3) ... [2021-02-21 20:38:19,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c8068b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:38:19, skipping insertion in model container [2021-02-21 20:38:19,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:38:19" (3/3) ... [2021-02-21 20:38:19,370 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2021-02-21 20:38:19,379 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 20:38:19,384 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 20:38:19,409 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 20:38:19,440 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 20:38:19,440 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 20:38:19,441 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 20:38:19,441 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 20:38:19,441 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 20:38:19,441 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 20:38:19,441 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 20:38:19,441 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 20:38:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2021-02-21 20:38:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-02-21 20:38:19,478 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:19,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:19,480 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1772381528, now seen corresponding path program 1 times [2021-02-21 20:38:19,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:19,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [331146338] [2021-02-21 20:38:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:19,612 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:19,786 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:19,787 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:19,789 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:19,790 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:19,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:19,804 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:19,810 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:19,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:19,819 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:19,820 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:19,829 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:19,830 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:19,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:19,967 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:19,968 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:38:19,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [331146338] [2021-02-21 20:38:19,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:19,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-21 20:38:19,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344847726] [2021-02-21 20:38:19,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-21 20:38:19,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:20,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-21 20:38:20,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-21 20:38:20,015 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 7 states. [2021-02-21 20:38:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:20,743 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2021-02-21 20:38:20,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-02-21 20:38:20,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2021-02-21 20:38:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:20,760 INFO L225 Difference]: With dead ends: 132 [2021-02-21 20:38:20,760 INFO L226 Difference]: Without dead ends: 71 [2021-02-21 20:38:20,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-02-21 20:38:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-02-21 20:38:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2021-02-21 20:38:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-02-21 20:38:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2021-02-21 20:38:20,861 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 26 [2021-02-21 20:38:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:20,862 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2021-02-21 20:38:20,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-21 20:38:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2021-02-21 20:38:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-21 20:38:20,866 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:20,866 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:20,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 20:38:20,867 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1109674261, now seen corresponding path program 1 times [2021-02-21 20:38:20,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:20,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [391785909] [2021-02-21 20:38:20,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:20,884 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:21,020 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,021 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:21,030 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,031 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,041 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,050 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:21,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:21,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,152 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:21,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:21,224 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,225 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:21,226 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,227 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-21 20:38:21,242 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,244 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-21 20:38:21,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:21,279 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:21,281 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,282 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-21 20:38:21,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:21,311 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,312 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:21,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:21,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,319 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-21 20:38:21,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [391785909] [2021-02-21 20:38:21,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:21,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-21 20:38:21,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367430425] [2021-02-21 20:38:21,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-21 20:38:21,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-21 20:38:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-21 20:38:21,338 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 9 states. [2021-02-21 20:38:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:21,679 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2021-02-21 20:38:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-21 20:38:21,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-02-21 20:38:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:21,686 INFO L225 Difference]: With dead ends: 105 [2021-02-21 20:38:21,687 INFO L226 Difference]: Without dead ends: 77 [2021-02-21 20:38:21,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-02-21 20:38:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-02-21 20:38:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2021-02-21 20:38:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-02-21 20:38:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-02-21 20:38:21,727 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 66 [2021-02-21 20:38:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:21,728 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-02-21 20:38:21,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-21 20:38:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-02-21 20:38:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-21 20:38:21,734 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:21,735 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:21,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 20:38:21,735 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash -499508081, now seen corresponding path program 1 times [2021-02-21 20:38:21,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:21,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95990597] [2021-02-21 20:38:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:21,748 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:21,871 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,896 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,897 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,898 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,905 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,906 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:21,942 WARN L141 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-02-21 20:38:21,943 WARN L147 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size 8 [2021-02-21 20:38:21,956 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:21,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:22,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:22,024 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,025 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:22,026 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,026 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:22,039 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,040 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:22,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:22,072 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:22,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:22,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:22,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,131 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:22,132 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,133 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:22,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:22,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:22,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:22,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,168 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:22,186 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:22,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:22,219 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:22,220 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:22,222 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,222 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:22,223 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:22,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-21 20:38:22,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [95990597] [2021-02-21 20:38:22,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:22,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-21 20:38:22,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760460376] [2021-02-21 20:38:22,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-21 20:38:22,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-21 20:38:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-02-21 20:38:22,263 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 17 states. [2021-02-21 20:38:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:24,016 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2021-02-21 20:38:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-02-21 20:38:24,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2021-02-21 20:38:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:24,020 INFO L225 Difference]: With dead ends: 126 [2021-02-21 20:38:24,020 INFO L226 Difference]: Without dead ends: 121 [2021-02-21 20:38:24,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-02-21 20:38:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-02-21 20:38:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2021-02-21 20:38:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-02-21 20:38:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2021-02-21 20:38:24,056 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 66 [2021-02-21 20:38:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:24,057 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2021-02-21 20:38:24,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-21 20:38:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2021-02-21 20:38:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-02-21 20:38:24,058 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:24,059 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:24,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 20:38:24,059 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:24,060 INFO L82 PathProgramCache]: Analyzing trace with hash -36617582, now seen corresponding path program 1 times [2021-02-21 20:38:24,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:24,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [11978161] [2021-02-21 20:38:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:24,065 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,113 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,116 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,130 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,131 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,198 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,202 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,203 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,218 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,219 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-21 20:38:24,234 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,236 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-21 20:38:24,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,260 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,262 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-02-21 20:38:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-02-21 20:38:24,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [11978161] [2021-02-21 20:38:24,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:24,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-21 20:38:24,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995386580] [2021-02-21 20:38:24,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-21 20:38:24,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-21 20:38:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-21 20:38:24,287 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 9 states. [2021-02-21 20:38:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:24,622 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2021-02-21 20:38:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-21 20:38:24,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2021-02-21 20:38:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:24,624 INFO L225 Difference]: With dead ends: 139 [2021-02-21 20:38:24,624 INFO L226 Difference]: Without dead ends: 85 [2021-02-21 20:38:24,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-02-21 20:38:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-02-21 20:38:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-02-21 20:38:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-02-21 20:38:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2021-02-21 20:38:24,650 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 66 [2021-02-21 20:38:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:24,651 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2021-02-21 20:38:24,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-21 20:38:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2021-02-21 20:38:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-02-21 20:38:24,652 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:24,653 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:24,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 20:38:24,653 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1317118349, now seen corresponding path program 1 times [2021-02-21 20:38:24,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:24,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776068722] [2021-02-21 20:38:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:24,659 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,706 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,715 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,715 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,735 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,736 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,737 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,738 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,752 WARN L141 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-02-21 20:38:24,756 WARN L147 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size 12 [2021-02-21 20:38:24,775 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,775 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,838 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,840 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,840 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:24,852 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:24,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,880 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:24,892 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,893 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:24,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:24,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,931 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,932 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:24,933 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,933 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:24,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:24,967 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:24,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,993 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:24,994 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:24,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:24,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:25,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:25,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 20:38:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:25,028 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:25,028 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-21 20:38:25,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776068722] [2021-02-21 20:38:25,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:25,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-02-21 20:38:25,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004791809] [2021-02-21 20:38:25,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-02-21 20:38:25,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:25,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-02-21 20:38:25,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-02-21 20:38:25,062 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 18 states. [2021-02-21 20:38:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:26,258 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2021-02-21 20:38:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-21 20:38:26,259 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2021-02-21 20:38:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:26,261 INFO L225 Difference]: With dead ends: 94 [2021-02-21 20:38:26,262 INFO L226 Difference]: Without dead ends: 91 [2021-02-21 20:38:26,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2021-02-21 20:38:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-02-21 20:38:26,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2021-02-21 20:38:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-02-21 20:38:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-02-21 20:38:26,297 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 75 [2021-02-21 20:38:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:26,298 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-02-21 20:38:26,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-02-21 20:38:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-02-21 20:38:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-02-21 20:38:26,299 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:26,300 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:26,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 20:38:26,300 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:26,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:26,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1546910366, now seen corresponding path program 1 times [2021-02-21 20:38:26,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:26,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623657804] [2021-02-21 20:38:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:26,305 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:26,343 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,343 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:26,344 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,345 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,348 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,349 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,354 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,354 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,360 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,361 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,368 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,369 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,377 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,378 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:38:26,397 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,398 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:26,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:26,453 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,454 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:26,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:26,478 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,479 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:26,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,496 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,496 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:26,518 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,519 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:26,520 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,520 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:26,548 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,549 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,567 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,567 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,586 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,587 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:26,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,617 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,618 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,664 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:26,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 20:38:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:26,734 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,734 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,758 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:26,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-21 20:38:26,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623657804] [2021-02-21 20:38:26,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:26,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-02-21 20:38:26,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660552320] [2021-02-21 20:38:26,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-02-21 20:38:26,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:26,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-02-21 20:38:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2021-02-21 20:38:26,795 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2021-02-21 20:38:28,139 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-02-21 20:38:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:28,588 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-02-21 20:38:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-21 20:38:28,589 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2021-02-21 20:38:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:28,590 INFO L225 Difference]: With dead ends: 98 [2021-02-21 20:38:28,591 INFO L226 Difference]: Without dead ends: 90 [2021-02-21 20:38:28,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2021-02-21 20:38:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-02-21 20:38:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-02-21 20:38:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-02-21 20:38:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-02-21 20:38:28,615 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 76 [2021-02-21 20:38:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:28,616 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-02-21 20:38:28,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-02-21 20:38:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-02-21 20:38:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-02-21 20:38:28,618 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:28,618 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:28,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 20:38:28,618 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1420644118, now seen corresponding path program 1 times [2021-02-21 20:38:28,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:28,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112873581] [2021-02-21 20:38:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:28,623 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:28,664 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,665 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:28,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,666 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,670 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,670 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,675 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,676 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,682 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,689 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,690 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,698 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,709 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,710 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:38:28,720 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,720 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:28,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:28,776 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,777 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:28,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:28,800 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,802 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:28,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,803 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:28,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,843 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:28,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,844 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:28,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,888 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,888 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:28,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,939 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,939 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:28,959 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,960 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:28,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:28,983 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:29,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 20:38:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:29,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:29,038 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:29,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-02-21 20:38:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:29,047 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:29,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:29,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:29,072 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:29,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 20:38:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:29,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:29,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-21 20:38:29,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112873581] [2021-02-21 20:38:29,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:29,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-02-21 20:38:29,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628665874] [2021-02-21 20:38:29,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-02-21 20:38:29,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-02-21 20:38:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2021-02-21 20:38:29,171 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 24 states. [2021-02-21 20:38:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:30,772 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2021-02-21 20:38:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-21 20:38:30,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2021-02-21 20:38:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:30,779 INFO L225 Difference]: With dead ends: 94 [2021-02-21 20:38:30,780 INFO L226 Difference]: Without dead ends: 87 [2021-02-21 20:38:30,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2021-02-21 20:38:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-02-21 20:38:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-02-21 20:38:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-02-21 20:38:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2021-02-21 20:38:30,805 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 90 [2021-02-21 20:38:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:30,806 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2021-02-21 20:38:30,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-02-21 20:38:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2021-02-21 20:38:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-02-21 20:38:30,808 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:30,808 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:30,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 20:38:30,808 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1561940976, now seen corresponding path program 2 times [2021-02-21 20:38:30,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:30,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349362634] [2021-02-21 20:38:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:30,814 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:30,863 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:30,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,867 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:30,868 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,869 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:30,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,880 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:30,889 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,889 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:30,900 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,901 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-21 20:38:30,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-21 20:38:30,919 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,919 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:30,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,936 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:30,956 WARN L141 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size [2021-02-21 20:38:30,959 WARN L147 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size 21 [2021-02-21 20:38:30,984 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:30,984 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:31,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,057 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,058 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:31,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,060 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,089 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,106 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:31,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,148 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,148 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,150 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,166 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:31,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,195 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,196 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:31,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,222 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:31,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,270 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,270 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,273 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,274 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:31,275 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,276 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-21 20:38:31,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 20:38:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,347 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,348 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,369 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,369 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-02-21 20:38:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,399 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,400 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:31,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 20:38:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:31,431 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,431 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-21 20:38:31,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:31,460 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:38:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-21 20:38:31,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349362634] [2021-02-21 20:38:31,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:31,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-02-21 20:38:31,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734254363] [2021-02-21 20:38:31,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-02-21 20:38:31,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:31,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-02-21 20:38:31,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2021-02-21 20:38:31,506 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 24 states. [2021-02-21 20:38:33,281 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2021-02-21 20:38:33,603 WARN L202 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-02-21 20:38:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:33,779 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-02-21 20:38:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-02-21 20:38:33,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2021-02-21 20:38:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:33,781 INFO L225 Difference]: With dead ends: 111 [2021-02-21 20:38:33,781 INFO L226 Difference]: Without dead ends: 102 [2021-02-21 20:38:33,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=309, Invalid=2447, Unknown=0, NotChecked=0, Total=2756 [2021-02-21 20:38:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-02-21 20:38:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2021-02-21 20:38:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-02-21 20:38:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2021-02-21 20:38:33,807 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 90 [2021-02-21 20:38:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:33,808 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2021-02-21 20:38:33,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-02-21 20:38:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2021-02-21 20:38:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-02-21 20:38:33,809 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:38:33,810 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:38:33,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 20:38:33,810 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:38:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:38:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash 176174744, now seen corresponding path program 1 times [2021-02-21 20:38:33,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:38:33,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857805347] [2021-02-21 20:38:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:38:33,815 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:38:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:33,850 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:33,854 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,854 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:33,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,855 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:33,860 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,861 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:33,866 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,867 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:33,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:33,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,886 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:38:33,897 WARN L141 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size [2021-02-21 20:38:33,898 WARN L147 QuantifierPusher]: treesize reduction 13, result has 38.1 percent of original size 8 [2021-02-21 20:38:33,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,910 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:33,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:38:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:33,990 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,990 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:33,991 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:33,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-02-21 20:38:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:34,017 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,018 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,031 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,032 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:34,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:34,056 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,057 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,073 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:34,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-02-21 20:38:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:34,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,086 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:34,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,106 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:34,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-02-21 20:38:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:34,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,134 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,134 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,135 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,135 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,136 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:34,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:38:34,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-02-21 20:38:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:34,185 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,185 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:34,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-02-21 20:38:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:34,191 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,191 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:34,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-21 20:38:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:38:34,198 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,199 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:38:34,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:38:34,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:38:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-21 20:38:34,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857805347] [2021-02-21 20:38:34,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:38:34,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-02-21 20:38:34,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567270753] [2021-02-21 20:38:34,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-02-21 20:38:34,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:38:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-02-21 20:38:34,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-02-21 20:38:34,235 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 19 states. [2021-02-21 20:38:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:38:35,742 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2021-02-21 20:38:35,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-02-21 20:38:35,743 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2021-02-21 20:38:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:38:35,743 INFO L225 Difference]: With dead ends: 105 [2021-02-21 20:38:35,743 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 20:38:35,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2021-02-21 20:38:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 20:38:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 20:38:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 20:38:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 20:38:35,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2021-02-21 20:38:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:38:35,747 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 20:38:35,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-02-21 20:38:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 20:38:35,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 20:38:35,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-21 20:38:35,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 20:38:37,218 WARN L202 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-02-21 20:38:37,519 WARN L202 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-02-21 20:38:37,627 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2021-02-21 20:38:37,837 WARN L202 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2021-02-21 20:38:38,177 WARN L202 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-21 20:38:38,359 WARN L202 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-21 20:38:38,742 WARN L202 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-21 20:38:39,067 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-02-21 20:38:39,330 WARN L202 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2021-02-21 20:38:39,657 WARN L202 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2021-02-21 20:38:40,192 WARN L202 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2021-02-21 20:38:40,366 WARN L202 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2021-02-21 20:38:40,542 WARN L202 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2021-02-21 20:38:40,794 WARN L202 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-21 20:38:40,967 WARN L202 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-21 20:38:41,226 WARN L202 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-21 20:38:41,574 WARN L202 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2021-02-21 20:38:41,825 WARN L202 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-02-21 20:38:41,973 WARN L202 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-21 20:38:42,122 WARN L202 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-02-21 20:38:42,562 WARN L202 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-02-21 20:38:42,941 WARN L202 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 45 [2021-02-21 20:38:43,292 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-02-21 20:38:43,592 WARN L202 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 30 [2021-02-21 20:38:43,693 WARN L202 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2021-02-21 20:38:43,913 WARN L202 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2021-02-21 20:38:44,178 WARN L202 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2021-02-21 20:38:44,283 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-02-21 20:38:44,283 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point __bswap_32ENTRY(lines 166 170) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point L169(line 169) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point L169-1(line 169) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point __bswap_32FINAL(lines 166 170) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point __bswap_32EXIT(lines 166 170) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point __uint64_identityFINAL(lines 186 190) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2021-02-21 20:38:44,284 INFO L189 CegarLoopUtils]: For program point __uint64_identityENTRY(lines 186 190) no Hoare annotation was computed. [2021-02-21 20:38:44,285 INFO L189 CegarLoopUtils]: For program point __uint64_identityEXIT(lines 186 190) no Hoare annotation was computed. [2021-02-21 20:38:44,285 INFO L192 CegarLoopUtils]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2021-02-21 20:38:44,285 INFO L192 CegarLoopUtils]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2021-02-21 20:38:44,285 INFO L192 CegarLoopUtils]: At program point L6(line 6) the Hoare annotation is: true [2021-02-21 20:38:44,285 INFO L192 CegarLoopUtils]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2021-02-21 20:38:44,285 INFO L192 CegarLoopUtils]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2021-02-21 20:38:44,285 INFO L189 CegarLoopUtils]: For program point __bswap_64ENTRY(lines 171 175) no Hoare annotation was computed. [2021-02-21 20:38:44,286 INFO L189 CegarLoopUtils]: For program point L174(line 174) no Hoare annotation was computed. [2021-02-21 20:38:44,286 INFO L189 CegarLoopUtils]: For program point L174-1(line 174) no Hoare annotation was computed. [2021-02-21 20:38:44,286 INFO L189 CegarLoopUtils]: For program point __bswap_64FINAL(lines 171 175) no Hoare annotation was computed. [2021-02-21 20:38:44,286 INFO L189 CegarLoopUtils]: For program point __bswap_64EXIT(lines 171 175) no Hoare annotation was computed. [2021-02-21 20:38:44,286 INFO L185 CegarLoopUtils]: At program point L547-2(line 547) the Hoare annotation is: (or (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret13.offset|) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= |main_#t~ret13.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (and (= main_~dev1~0.base 0) (= |main_#t~ret13.offset| 0) (= main_~dev1~0.offset 0) (= |main_#t~ret13.base| 0)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-21 20:38:44,286 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 545 556) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-21 20:38:44,286 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 545 556) the Hoare annotation is: true [2021-02-21 20:38:44,286 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 545 556) the Hoare annotation is: true [2021-02-21 20:38:44,287 INFO L185 CegarLoopUtils]: At program point L552(line 552) the Hoare annotation is: (let ((.cse1 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse0 (<= 2 main_~dev2~0.offset)) (.cse2 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) (<= 1 ~guard_malloc_counter~0.offset)) (and .cse1 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) .cse2) (and .cse1 (<= main_~dev2~0.offset 2) (not (= 2 ~elem~0.offset)) .cse0 (= main_~dev2~0.base ~elem~0.base) .cse2) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-21 20:38:44,287 INFO L185 CegarLoopUtils]: At program point L551(line 551) the Hoare annotation is: (let ((.cse0 (<= 2 main_~dev2~0.offset)) (.cse1 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (= ~elem~0.offset 0) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (let ((.cse2 (<= main_~dev2~0.offset 2)) (.cse3 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (and .cse2 .cse0 (= main_~dev2~0.base ~elem~0.base) .cse3) (and .cse2 .cse0 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset) .cse3))) .cse1))) [2021-02-21 20:38:44,287 INFO L185 CegarLoopUtils]: At program point L550(line 550) the Hoare annotation is: (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-21 20:38:44,287 INFO L185 CegarLoopUtils]: At program point L549(lines 549 554) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset))) (or (and (= main_~dev2~0.offset 0) (= ~elem~0.offset 0) (= main_~dev2~0.base 0) .cse0) (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse0) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-21 20:38:44,288 INFO L185 CegarLoopUtils]: At program point L550-1(line 550) the Hoare annotation is: (let ((.cse1 (+ main_~dev1~0.offset 1))) (let ((.cse0 (<= main_~dev2~0.offset 2)) (.cse2 (<= .cse1 main_~dev2~0.offset)) (.cse3 (<= 1 ~guard_malloc_counter~0.offset))) (or (and .cse0 (<= 2 main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) (<= .cse1 ~elem~0.offset) .cse2 .cse3) (and .cse0 (<= 1 main_~dev1~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse2 .cse3) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-21 20:38:44,288 INFO L185 CegarLoopUtils]: At program point L548(line 548) the Hoare annotation is: (or (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-21 20:38:44,288 INFO L192 CegarLoopUtils]: At program point L549-1(lines 549 554) the Hoare annotation is: true [2021-02-21 20:38:44,288 INFO L185 CegarLoopUtils]: At program point L547(line 547) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-21 20:38:44,288 INFO L185 CegarLoopUtils]: At program point L548-1(line 548) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset))) (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (<= (+ main_~dev1~0.offset 1) |main_#t~ret14.offset|) (<= 1 main_~dev1~0.offset) (<= |main_#t~ret14.offset| 2) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset) .cse0) (and (= |main_#t~ret14.offset| 0) (= |main_#t~ret14.base| 0) (= ~elem~0.offset 0) .cse0) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-21 20:38:44,288 INFO L185 CegarLoopUtils]: At program point L546(line 546) the Hoare annotation is: (or (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.offset 0) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.offset 0))) [2021-02-21 20:38:44,288 INFO L185 CegarLoopUtils]: At program point L547-1(line 547) the Hoare annotation is: (or (and (= |main_#t~ret13.offset| 0) (= |main_#t~ret13.base| 0)) (and (<= ~guard_malloc_counter~0.offset (+ |old(~guard_malloc_counter~0.offset)| 1)) (<= 1 |main_#t~ret13.offset|) (<= |main_#t~ret13.offset| ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (not (= |old(~elem~0.offset)| 0))) [2021-02-21 20:38:44,289 INFO L185 CegarLoopUtils]: At program point L548-2(line 548) the Hoare annotation is: (let ((.cse0 (= ~elem~0.offset 0)) (.cse1 (<= 1 ~guard_malloc_counter~0.offset))) (or (and (<= main_~dev2~0.offset 2) (<= 1 main_~dev1~0.offset) .cse0 (<= |main_#t~ret14.offset| 2) (= |old(~elem~0.base)| ~elem~0.base) (<= 2 |main_#t~ret14.offset|) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse1) (and (= |main_#t~ret14.offset| 0) (= main_~dev2~0.offset 0) (= |main_#t~ret14.base| 0) .cse0 (= main_~dev2~0.base 0) .cse1) (not (= |old(~guard_malloc_counter~0.offset)| 0)) (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 0)) (not (= |old(~elem~0.offset)| 0)))) [2021-02-21 20:38:44,289 INFO L185 CegarLoopUtils]: At program point __getMemoryENTRY(lines 520 527) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,289 INFO L185 CegarLoopUtils]: At program point __getMemoryEXIT(lines 520 527) the Hoare annotation is: (let ((.cse3 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (<= .cse3 ~guard_malloc_counter~0.offset)) (.cse1 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= |__getMemory_#res.offset| 0) .cse0 (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (let ((.cse2 (not (= |__getMemory_#in~size| 8)))) (and (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse2 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= ~guard_malloc_counter~0.offset .cse3) .cse0 (<= .cse3 |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| .cse3)) (not (= ~elem~0.offset 0))))) [2021-02-21 20:38:44,289 INFO L185 CegarLoopUtils]: At program point __getMemoryFINAL(lines 520 527) the Hoare annotation is: (let ((.cse3 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (<= .cse3 ~guard_malloc_counter~0.offset)) (.cse1 (= 8 __getMemory_~size))) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= |__getMemory_#res.offset| 0) .cse0 (<= |__getMemory_#res.base| 0) .cse1 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)) (let ((.cse2 (not (= |__getMemory_#in~size| 8)))) (and (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse2 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (<= ~guard_malloc_counter~0.offset .cse3) .cse0 (<= .cse3 |__getMemory_#res.offset|) .cse1 (<= |__getMemory_#res.offset| .cse3)) (not (= ~elem~0.offset 0))))) [2021-02-21 20:38:44,289 INFO L185 CegarLoopUtils]: At program point L526(line 526) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,290 INFO L185 CegarLoopUtils]: At program point L525(line 525) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2021-02-21 20:38:44,290 INFO L185 CegarLoopUtils]: At program point L524(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,290 INFO L185 CegarLoopUtils]: At program point L523(line 523) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |__getMemory_#t~post9.offset| |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,290 INFO L185 CegarLoopUtils]: At program point L524-1(lines 524 525) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,290 INFO L185 CegarLoopUtils]: At program point L522(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,290 INFO L185 CegarLoopUtils]: At program point L523-1(line 523) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (= |__getMemory_#t~post9.offset| |old(~guard_malloc_counter~0.offset)|) (<= ~guard_malloc_counter~0.offset .cse1) (<= .cse1 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,291 INFO L185 CegarLoopUtils]: At program point L524-2(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2021-02-21 20:38:44,291 INFO L185 CegarLoopUtils]: At program point L524-3(line 524) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (+ |old(~guard_malloc_counter~0.offset)| 1))) (and (<= ~guard_malloc_counter~0.offset .cse0) (<= .cse0 ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) (let ((.cse1 (not (= |__getMemory_#in~size| 8)))) (and (or .cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse1 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,291 INFO L185 CegarLoopUtils]: At program point L522-2(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,291 INFO L185 CegarLoopUtils]: At program point L522-3(line 522) the Hoare annotation is: (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (let ((.cse0 (not (= |__getMemory_#in~size| 8)))) (and (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (or .cse0 (not (= |old(~guard_malloc_counter~0.offset)| 0))))) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= 8 __getMemory_~size)) (not (= ~elem~0.offset 0))) [2021-02-21 20:38:44,291 INFO L189 CegarLoopUtils]: For program point __uint32_identityFINAL(lines 181 185) no Hoare annotation was computed. [2021-02-21 20:38:44,291 INFO L189 CegarLoopUtils]: For program point __uint32_identityENTRY(lines 181 185) no Hoare annotation was computed. [2021-02-21 20:38:44,291 INFO L189 CegarLoopUtils]: For program point L184(line 184) no Hoare annotation was computed. [2021-02-21 20:38:44,291 INFO L189 CegarLoopUtils]: For program point __uint32_identityEXIT(lines 181 185) no Hoare annotation was computed. [2021-02-21 20:38:44,292 INFO L185 CegarLoopUtils]: At program point L529(line 529) the Hoare annotation is: (or (not (= |my_malloc_#in~size| 8)) (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= my_malloc_~size 8))) [2021-02-21 20:38:44,292 INFO L185 CegarLoopUtils]: At program point my_mallocFINAL(lines 528 530) the Hoare annotation is: (let ((.cse8 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse11 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse4 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse10 (not (= |my_malloc_#in~size| 8)))) (let ((.cse0 (<= 0 |my_malloc_#res.base|)) (.cse1 (<= |my_malloc_#res.base| 0)) (.cse2 (<= 0 |my_malloc_#res.offset|)) (.cse3 (<= |my_malloc_#res.offset| 0)) (.cse5 (and (or .cse11 .cse10) (or .cse4 .cse10))) (.cse9 (not (= ~elem~0.offset 0))) (.cse6 (<= ~guard_malloc_counter~0.offset .cse8)) (.cse7 (<= .cse8 |my_malloc_#res.offset|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (and .cse6 .cse7 (<= |my_malloc_#res.offset| .cse8) (<= 1 ~guard_malloc_counter~0.offset)) .cse9) (or .cse10 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse11 (and (<= .cse8 ~guard_malloc_counter~0.offset) .cse0 .cse1 .cse2 .cse3) .cse5 .cse9 (and .cse6 (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse7))))) [2021-02-21 20:38:44,292 INFO L185 CegarLoopUtils]: At program point L529-1(line 529) the Hoare annotation is: (let ((.cse1 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse10 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse9 (not (= |my_malloc_#in~size| 8))) (.cse4 (+ |old(~guard_malloc_counter~0.offset)| 1))) (let ((.cse0 (and (<= ~guard_malloc_counter~0.offset .cse4) (<= |my_malloc_#t~ret11.offset| ~guard_malloc_counter~0.offset) (<= .cse4 |my_malloc_#t~ret11.offset|))) (.cse2 (and (or .cse1 .cse9) (or .cse10 .cse9))) (.cse5 (<= 0 |my_malloc_#t~ret11.offset|)) (.cse6 (<= |my_malloc_#t~ret11.offset| 0)) (.cse7 (<= |my_malloc_#t~ret11.base| 0)) (.cse8 (<= 0 |my_malloc_#t~ret11.base|)) (.cse3 (not (= ~elem~0.offset 0)))) (and (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse0 .cse1 .cse2 .cse3 (and (<= .cse4 ~guard_malloc_counter~0.offset) .cse5 .cse6 .cse7 .cse8)) (or .cse9 (= my_malloc_~size 8)) (or .cse0 .cse10 .cse2 (and .cse5 .cse6 .cse7 .cse8) .cse3)))) [2021-02-21 20:38:44,292 INFO L185 CegarLoopUtils]: At program point L529-2(line 529) the Hoare annotation is: (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse10 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse14 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse0 (not (= |my_malloc_#in~size| 8)))) (let ((.cse2 (<= 0 |my_malloc_#t~ret11.offset|)) (.cse3 (<= 0 |my_malloc_#res.base|)) (.cse4 (<= |my_malloc_#res.base| 0)) (.cse5 (<= 0 |my_malloc_#res.offset|)) (.cse6 (<= |my_malloc_#t~ret11.offset| 0)) (.cse7 (<= |my_malloc_#t~ret11.base| 0)) (.cse8 (<= |my_malloc_#res.offset| 0)) (.cse9 (<= 0 |my_malloc_#t~ret11.base|)) (.cse11 (and (or .cse10 .cse0) (or .cse14 .cse0))) (.cse12 (and (<= ~guard_malloc_counter~0.offset .cse1) (<= |my_malloc_#t~ret11.offset| ~guard_malloc_counter~0.offset) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|) (<= .cse1 |my_malloc_#t~ret11.offset|))) (.cse13 (not (= ~elem~0.offset 0)))) (and (or .cse0 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) (and (<= .cse1 ~guard_malloc_counter~0.offset) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse14 .cse11 .cse12 .cse13)))) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point my_mallocENTRY(lines 528 530) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|)) (not (= |my_malloc_#in~size| 8))) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point my_mallocEXIT(lines 528 530) the Hoare annotation is: (let ((.cse8 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse11 (not (<= 1 |old(~guard_malloc_counter~0.offset)|))) (.cse4 (not (= |old(~guard_malloc_counter~0.offset)| 0))) (.cse10 (not (= |my_malloc_#in~size| 8)))) (let ((.cse0 (<= 0 |my_malloc_#res.base|)) (.cse1 (<= |my_malloc_#res.base| 0)) (.cse2 (<= 0 |my_malloc_#res.offset|)) (.cse3 (<= |my_malloc_#res.offset| 0)) (.cse5 (and (or .cse11 .cse10) (or .cse4 .cse10))) (.cse9 (not (= ~elem~0.offset 0))) (.cse6 (<= ~guard_malloc_counter~0.offset .cse8)) (.cse7 (<= .cse8 |my_malloc_#res.offset|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (and .cse6 .cse7 (<= |my_malloc_#res.offset| .cse8) (<= 1 ~guard_malloc_counter~0.offset)) .cse9) (or .cse10 (= my_malloc_~size 8)) (or (not (<= |old(~guard_malloc_counter~0.offset)| 1)) .cse11 (and (<= .cse8 ~guard_malloc_counter~0.offset) .cse0 .cse1 .cse2 .cse3) .cse5 .cse9 (and .cse6 (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse7))))) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point L3-2(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point L3-3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point L544(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point L3-4(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,293 INFO L185 CegarLoopUtils]: At program point L544-1(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-21 20:38:44,294 INFO L185 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,294 INFO L185 CegarLoopUtils]: At program point L3-5(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,294 INFO L185 CegarLoopUtils]: At program point L544-2(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-21 20:38:44,294 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 544) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-21 20:38:44,294 INFO L185 CegarLoopUtils]: At program point L534(line 534) the Hoare annotation is: (and (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset 0)) [2021-02-21 20:38:44,294 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |~#head~0.offset| |old(~#head~0.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,294 INFO L185 CegarLoopUtils]: At program point L3(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point L3-1(line 3) the Hoare annotation is: (and (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~elem~0.base |old(~elem~0.base)|)) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point L542(line 542) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point L541(lines 541 542) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset))) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point L541-2(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point list_delEXIT(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (= ~elem~0.offset 0) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point list_delENTRY(lines 540 543) the Hoare annotation is: (or (not (<= 1 ~guard_malloc_counter~0.offset)) (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset))) [2021-02-21 20:38:44,295 INFO L185 CegarLoopUtils]: At program point list_addENTRY(lines 535 539) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| ~elem~0.offset)))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse0) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0))) [2021-02-21 20:38:44,296 INFO L185 CegarLoopUtils]: At program point L538(line 538) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-21 20:38:44,296 INFO L185 CegarLoopUtils]: At program point L537(lines 537 538) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-21 20:38:44,296 INFO L185 CegarLoopUtils]: At program point L536(line 536) the Hoare annotation is: (let ((.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse1 .cse3 .cse2)) (or .cse4 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse2)) (or .cse4 .cse0 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-21 20:38:44,296 INFO L185 CegarLoopUtils]: At program point L537-1(line 537) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (and .cse2 .cse3) .cse1 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-21 20:38:44,297 INFO L185 CegarLoopUtils]: At program point L535(lines 535 539) the Hoare annotation is: (let ((.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse0 (= list_add_~new.base |list_add_#in~new.base|))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (and .cse0 (= ~elem~0.base |list_add_#in~new.base|) .cse1 .cse2) (not (<= |list_add_#in~new.offset| 2))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (and .cse1 .cse3 .cse2)) (or .cse4 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse2)) (or .cse4 .cse0 (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))))) [2021-02-21 20:38:44,297 INFO L185 CegarLoopUtils]: At program point L536-2(line 536) the Hoare annotation is: (and (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (or (not (<= 1 ~guard_malloc_counter~0.offset)) (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|))) (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) (not (<= |list_add_#in~new.offset| 2)))) [2021-02-21 20:38:44,297 INFO L185 CegarLoopUtils]: At program point L537-3(line 537) the Hoare annotation is: (let ((.cse5 (= |old(~elem~0.base)| ~elem~0.base)) (.cse6 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse2 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse3 (= list_add_~new.base |list_add_#in~new.base|)) (.cse4 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (not (<= 2 |list_add_#in~new.offset|))) (.cse1 (and .cse5 .cse6))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) .cse0 .cse1 (not (<= |list_add_#in~new.offset| 2))) (or .cse2 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse3 .cse4 .cse5 .cse6)) (or .cse2 (and .cse3 .cse4) .cse0 (not (= |old(~elem~0.offset)| 0))) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse1)))) [2021-02-21 20:38:44,297 INFO L185 CegarLoopUtils]: At program point L536-3(line 536) the Hoare annotation is: (let ((.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse5 (= |old(~elem~0.offset)| ~elem~0.offset))) (let ((.cse1 (not (<= 1 ~guard_malloc_counter~0.offset))) (.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (and .cse4 .cse5))) (and (or (= |old(~elem~0.offset)| 2) (not (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 2 |list_add_#in~new.offset|)) .cse0 (not (<= |list_add_#in~new.offset| 2))) (or .cse1 (and .cse2 .cse3) (not (<= 1 |list_add_#in~new.offset|)) (not (= |old(~elem~0.offset)| 0))) (or .cse1 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse4 .cse5)) (or (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) .cse0)))) [2021-02-21 20:38:44,297 INFO L185 CegarLoopUtils]: At program point L537-4(lines 535 539) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2021-02-21 20:38:44,298 INFO L185 CegarLoopUtils]: At program point list_addEXIT(lines 535 539) the Hoare annotation is: (let ((.cse4 (= list_add_~new.base |list_add_#in~new.base|)) (.cse5 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse6 (<= 1 ~guard_malloc_counter~0.offset))) (let ((.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (and .cse4 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|) .cse5 .cse6)) (.cse0 (not .cse6)) (.cse1 (not (= |old(~elem~0.offset)| 0)))) (and (or .cse0 (not (<= 1 |list_add_#in~new.offset|)) .cse1 (and (= ~elem~0.offset 0) .cse2) .cse3) (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse4 .cse5 .cse2 (= |old(~elem~0.offset)| ~elem~0.offset)) .cse3) (or (and .cse4 .cse5) .cse0 (not (<= 2 |list_add_#in~new.offset|)) .cse1)))) [2021-02-21 20:38:44,298 INFO L189 CegarLoopUtils]: For program point __uint16_identityENTRY(lines 176 180) no Hoare annotation was computed. [2021-02-21 20:38:44,298 INFO L189 CegarLoopUtils]: For program point __uint16_identityEXIT(lines 176 180) no Hoare annotation was computed. [2021-02-21 20:38:44,298 INFO L189 CegarLoopUtils]: For program point __uint16_identityFINAL(lines 176 180) no Hoare annotation was computed. [2021-02-21 20:38:44,298 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-02-21 20:38:44,298 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:38:44,298 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.offset 0)) [2021-02-21 20:38:44,298 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 20:38:44,299 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 20:38:44,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 08:38:44 BoogieIcfgContainer [2021-02-21 20:38:44,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-21 20:38:44,324 INFO L168 Benchmark]: Toolchain (without parser) took 26502.80 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 130.6 MB in the beginning and 193.8 MB in the end (delta: -63.2 MB). Peak memory consumption was 229.5 MB. Max. memory is 8.0 GB. [2021-02-21 20:38:44,325 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory is still 127.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 20:38:44,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.59 ms. Allocated memory is still 155.2 MB. Free memory was 129.5 MB in the beginning and 107.6 MB in the end (delta: 21.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:38:44,325 INFO L168 Benchmark]: Boogie Preprocessor took 72.70 ms. Allocated memory is still 155.2 MB. Free memory was 107.5 MB in the beginning and 105.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-02-21 20:38:44,326 INFO L168 Benchmark]: RCFGBuilder took 863.56 ms. Allocated memory is still 155.2 MB. Free memory was 105.0 MB in the beginning and 94.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 8.0 GB. [2021-02-21 20:38:44,326 INFO L168 Benchmark]: TraceAbstraction took 24962.71 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 94.6 MB in the beginning and 193.8 MB in the end (delta: -99.2 MB). Peak memory consumption was 193.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:38:44,327 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory is still 127.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 583.59 ms. Allocated memory is still 155.2 MB. Free memory was 129.5 MB in the beginning and 107.6 MB in the end (delta: 21.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.70 ms. Allocated memory is still 155.2 MB. Free memory was 107.5 MB in the beginning and 105.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 863.56 ms. Allocated memory is still 155.2 MB. Free memory was 105.0 MB in the beginning and 94.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24962.71 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 94.6 MB in the beginning and 193.8 MB in the end (delta: -99.2 MB). Peak memory consumption was 193.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 545]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 520]: Procedure Contract for __getMemory Derived contract for procedure __getMemory: (((!(\old(guard_malloc_counter) <= 1) || (((((\result <= 0 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \result <= 0) && 8 == size) && 0 <= \result) && 0 <= \result)) || ((!(\old(size) == 8) || !(1 <= \old(guard_malloc_counter))) && (!(\old(size) == 8) || !(\old(guard_malloc_counter) == 0)))) || ((((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result) && 8 == size) && \result <= \old(guard_malloc_counter) + 1)) || !(elem == 0) - ProcedureContractResult [Line: 528]: Procedure Contract for my_malloc Derived contract for procedure my_malloc: ((((((((0 <= \result && \result <= 0) && 0 <= \result) && \result <= 0) || !(\old(guard_malloc_counter) == 0)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || (((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \old(guard_malloc_counter) + 1 <= \result) && \result <= \old(guard_malloc_counter) + 1) && 1 <= guard_malloc_counter)) || !(elem == 0)) && (!(\old(size) == 8) || size == 8)) && (((((!(\old(guard_malloc_counter) <= 1) || !(1 <= \old(guard_malloc_counter))) || ((((\old(guard_malloc_counter) + 1 <= guard_malloc_counter && 0 <= \result) && \result <= 0) && 0 <= \result) && \result <= 0)) || ((!(1 <= \old(guard_malloc_counter)) || !(\old(size) == 8)) && (!(\old(guard_malloc_counter) == 0) || !(\old(size) == 8)))) || !(elem == 0)) || ((guard_malloc_counter <= \old(guard_malloc_counter) + 1 && \result <= guard_malloc_counter) && \old(guard_malloc_counter) + 1 <= \result)) - ProcedureContractResult [Line: 540]: Procedure Contract for list_del Derived contract for procedure list_del: (!(1 <= guard_malloc_counter) || elem == 0) || (\old(elem) == elem && \old(elem) == elem) - ProcedureContractResult [Line: 535]: Procedure Contract for list_add Derived contract for procedure list_add: (((((!(1 <= guard_malloc_counter) || !(1 <= new)) || !(\old(elem) == 0)) || (elem == 0 && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter)) && (((!(1 <= guard_malloc_counter) || !(new + 1 <= \old(elem))) || (((new == new && new == new) && \old(elem) == elem) && \old(elem) == elem)) || ((((new == new && elem == new) && elem == new) && new == new) && 1 <= guard_malloc_counter))) && ((((new == new && new == new) || !(1 <= guard_malloc_counter)) || !(2 <= new)) || !(\old(elem) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.3s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 568 SDtfs, 908 SDslu, 2569 SDs, 0 SdLazy, 5942 SolverSat, 387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 379 PreInvPairs, 637 NumberOfFragments, 2907 HoareAnnotationTreeSize, 379 FomulaSimplifications, 27510 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 76 FomulaSimplificationsInter, 8318 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...