/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/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 20:42:23,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 20:42:23,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 20:42:23,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 20:42:23,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 20:42:23,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 20:42:23,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 20:42:23,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 20:42:23,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 20:42:23,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 20:42:23,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 20:42:23,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 20:42:23,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 20:42:23,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 20:42:23,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 20:42:23,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 20:42:23,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 20:42:23,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 20:42:23,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 20:42:23,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 20:42:23,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 20:42:23,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 20:42:23,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 20:42:23,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 20:42:23,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 20:42:23,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 20:42:23,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 20:42:23,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 20:42:23,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 20:42:23,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 20:42:23,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 20:42:23,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 20:42:23,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 20:42:23,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 20:42:23,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 20:42:23,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 20:42:23,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 20:42:23,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 20:42:23,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 20:42:23,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 20:42:23,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 20:42:23,260 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:42:23,273 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 20:42:23,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 20:42:23,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 20:42:23,275 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 20:42:23,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 20:42:23,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 20:42:23,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 20:42:23,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 20:42:23,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 20:42:23,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 20:42:23,277 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 20:42:23,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 20:42:23,277 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 20:42:23,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 20:42:23,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 20:42:23,278 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 20:42:23,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 20:42:23,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 20:42:23,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:42:23,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 20:42:23,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 20:42:23,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 20:42:23,279 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:42:23,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 20:42:23,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 20:42:23,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 20:42:23,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 20:42:23,712 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 20:42:23,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2021-02-21 20:42:23,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c70e161f/690014f1757a4c98988987e89d6d6509/FLAG7234efaab [2021-02-21 20:42:24,413 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 20:42:24,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2021-02-21 20:42:24,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c70e161f/690014f1757a4c98988987e89d6d6509/FLAG7234efaab [2021-02-21 20:42:24,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c70e161f/690014f1757a4c98988987e89d6d6509 [2021-02-21 20:42:24,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 20:42:24,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 20:42:24,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 20:42:24,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 20:42:24,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 20:42:24,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:42:24" (1/1) ... [2021-02-21 20:42:24,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132024e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:24, skipping insertion in model container [2021-02-21 20:42:24,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:42:24" (1/1) ... [2021-02-21 20:42:24,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 20:42:24,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 20:42:25,165 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-02-21 20:42:25,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:42:25,181 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 20:42:25,229 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-02-21 20:42:25,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:42:25,293 INFO L208 MainTranslator]: Completed translation [2021-02-21 20:42:25,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25 WrapperNode [2021-02-21 20:42:25,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 20:42:25,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 20:42:25,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 20:42:25,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 20:42:25,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (1/1) ... [2021-02-21 20:42:25,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (1/1) ... [2021-02-21 20:42:25,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (1/1) ... [2021-02-21 20:42:25,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (1/1) ... [2021-02-21 20:42:25,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (1/1) ... [2021-02-21 20:42:25,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (1/1) ... [2021-02-21 20:42:25,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (1/1) ... [2021-02-21 20:42:25,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 20:42:25,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 20:42:25,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 20:42:25,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 20:42:25,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (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:42:25,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 20:42:25,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 20:42:25,483 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 20:42:25,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-02-21 20:42:25,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-02-21 20:42:25,483 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-02-21 20:42:25,483 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-02-21 20:42:25,483 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2021-02-21 20:42:25,484 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2021-02-21 20:42:25,484 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2021-02-21 20:42:25,484 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2021-02-21 20:42:25,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 20:42:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 20:42:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 20:42:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-02-21 20:42:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-02-21 20:42:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 20:42:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 20:42:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-02-21 20:42:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-02-21 20:42:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-02-21 20:42:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-02-21 20:42:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-02-21 20:42:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-02-21 20:42:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-02-21 20:42:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-02-21 20:42:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-02-21 20:42:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-02-21 20:42:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-02-21 20:42:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-02-21 20:42:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-02-21 20:42:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-02-21 20:42:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-02-21 20:42:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-02-21 20:42:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-02-21 20:42:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-02-21 20:42:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-02-21 20:42:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-02-21 20:42:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-02-21 20:42:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-02-21 20:42:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-02-21 20:42:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-02-21 20:42:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-02-21 20:42:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-02-21 20:42:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-02-21 20:42:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-02-21 20:42:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-02-21 20:42:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-02-21 20:42:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-02-21 20:42:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-02-21 20:42:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-02-21 20:42:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-02-21 20:42:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-02-21 20:42:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-02-21 20:42:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-02-21 20:42:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-02-21 20:42:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-02-21 20:42:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-02-21 20:42:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-02-21 20:42:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-02-21 20:42:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-02-21 20:42:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-02-21 20:42:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-02-21 20:42:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-02-21 20:42:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-02-21 20:42:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-02-21 20:42:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-02-21 20:42:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-02-21 20:42:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-02-21 20:42:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-02-21 20:42:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-02-21 20:42:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-21 20:42:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-02-21 20:42:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-21 20:42:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-02-21 20:42:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-02-21 20:42:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-02-21 20:42:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-02-21 20:42:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-02-21 20:42:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-02-21 20:42:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-02-21 20:42:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-02-21 20:42:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-02-21 20:42:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-02-21 20:42:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-02-21 20:42:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-02-21 20:42:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-02-21 20:42:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-02-21 20:42:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-02-21 20:42:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-02-21 20:42:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-02-21 20:42:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-02-21 20:42:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-02-21 20:42:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-02-21 20:42:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-02-21 20:42:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-02-21 20:42:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-02-21 20:42:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-02-21 20:42:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-02-21 20:42:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-02-21 20:42:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-02-21 20:42:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-02-21 20:42:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-02-21 20:42:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-02-21 20:42:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-02-21 20:42:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-02-21 20:42:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-02-21 20:42:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-02-21 20:42:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-02-21 20:42:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-02-21 20:42:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-02-21 20:42:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-02-21 20:42:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-02-21 20:42:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-02-21 20:42:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-02-21 20:42:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-02-21 20:42:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-02-21 20:42:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-02-21 20:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-02-21 20:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-02-21 20:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-02-21 20:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-02-21 20:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-02-21 20:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-02-21 20:42:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-21 20:42:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-02-21 20:42:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 20:42:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2021-02-21 20:42:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2021-02-21 20:42:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-02-21 20:42:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 20:42:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2021-02-21 20:42:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 20:42:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2021-02-21 20:42:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 20:42:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 20:42:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 20:42:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 20:42:25,928 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-02-21 20:42:26,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 20:42:26,106 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-02-21 20:42:26,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:42:26 BoogieIcfgContainer [2021-02-21 20:42:26,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 20:42:26,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 20:42:26,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 20:42:26,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 20:42:26,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 08:42:24" (1/3) ... [2021-02-21 20:42:26,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444b0b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:42:26, skipping insertion in model container [2021-02-21 20:42:26,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:42:25" (2/3) ... [2021-02-21 20:42:26,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444b0b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:42:26, skipping insertion in model container [2021-02-21 20:42:26,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:42:26" (3/3) ... [2021-02-21 20:42:26,132 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-02-21 20:42:26,143 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 20:42:26,149 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 20:42:26,171 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 20:42:26,198 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 20:42:26,198 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 20:42:26,198 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 20:42:26,198 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 20:42:26,199 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 20:42:26,199 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 20:42:26,199 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 20:42:26,199 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 20:42:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2021-02-21 20:42:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-02-21 20:42:26,232 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:26,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:42:26,233 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:26,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2073568287, now seen corresponding path program 1 times [2021-02-21 20:42:26,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:26,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905196320] [2021-02-21 20:42:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:26,354 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:26,526 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:26,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:26,530 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:26,532 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:26,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:26,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:26,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:26,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:26,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:26,667 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:26,668 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:26,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:26,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:42:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:26,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:26,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:26,691 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:42:26,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905196320] [2021-02-21 20:42:26,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:26,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-21 20:42:26,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40999358] [2021-02-21 20:42:26,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-21 20:42:26,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-21 20:42:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-21 20:42:26,723 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2021-02-21 20:42:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:27,254 INFO L93 Difference]: Finished difference Result 235 states and 290 transitions. [2021-02-21 20:42:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-02-21 20:42:27,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2021-02-21 20:42:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:27,268 INFO L225 Difference]: With dead ends: 235 [2021-02-21 20:42:27,269 INFO L226 Difference]: Without dead ends: 132 [2021-02-21 20:42:27,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-02-21 20:42:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-02-21 20:42:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2021-02-21 20:42:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-02-21 20:42:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-02-21 20:42:27,339 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 42 [2021-02-21 20:42:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:27,340 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-02-21 20:42:27,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-21 20:42:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-02-21 20:42:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-02-21 20:42:27,343 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:27,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:42:27,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 20:42:27,343 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:27,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1487845686, now seen corresponding path program 1 times [2021-02-21 20:42:27,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:27,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821128393] [2021-02-21 20:42:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:27,352 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:27,410 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:27,411 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:27,412 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:27,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:27,416 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:27,417 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:27,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:27,450 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:27,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:27,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:27,485 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:27,486 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:27,492 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:27,493 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:27,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:42:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:27,508 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:27,509 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:27,514 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:42:27,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821128393] [2021-02-21 20:42:27,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:27,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-21 20:42:27,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484100735] [2021-02-21 20:42:27,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-21 20:42:27,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:27,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-21 20:42:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-21 20:42:27,518 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 7 states. [2021-02-21 20:42:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:27,982 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-02-21 20:42:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-02-21 20:42:27,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2021-02-21 20:42:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:27,985 INFO L225 Difference]: With dead ends: 149 [2021-02-21 20:42:27,986 INFO L226 Difference]: Without dead ends: 96 [2021-02-21 20:42:27,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-02-21 20:42:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-02-21 20:42:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2021-02-21 20:42:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-02-21 20:42:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2021-02-21 20:42:28,006 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 42 [2021-02-21 20:42:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:28,006 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2021-02-21 20:42:28,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-21 20:42:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2021-02-21 20:42:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-02-21 20:42:28,009 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:28,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:28,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 20:42:28,010 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash -762840836, now seen corresponding path program 1 times [2021-02-21 20:42:28,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:28,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148952044] [2021-02-21 20:42:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:28,078 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:28,083 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,161 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,163 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:28,167 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,168 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,214 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,216 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,279 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:28,287 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,287 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:28,295 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,296 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:28,305 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,305 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:28,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,326 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,326 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-21 20:42:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,333 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,334 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,341 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:42:28,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148952044] [2021-02-21 20:42:28,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:28,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-21 20:42:28,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617137681] [2021-02-21 20:42:28,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-21 20:42:28,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:28,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-21 20:42:28,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-21 20:42:28,344 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 9 states. [2021-02-21 20:42:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:28,757 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2021-02-21 20:42:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-02-21 20:42:28,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2021-02-21 20:42:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:28,760 INFO L225 Difference]: With dead ends: 158 [2021-02-21 20:42:28,760 INFO L226 Difference]: Without dead ends: 105 [2021-02-21 20:42:28,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-02-21 20:42:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-02-21 20:42:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2021-02-21 20:42:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-02-21 20:42:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-02-21 20:42:28,778 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 60 [2021-02-21 20:42:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:28,779 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-02-21 20:42:28,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-21 20:42:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-02-21 20:42:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-21 20:42:28,783 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:28,783 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, 1, 1] [2021-02-21 20:42:28,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 20:42:28,783 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2138915502, now seen corresponding path program 2 times [2021-02-21 20:42:28,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:28,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796066787] [2021-02-21 20:42:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:28,815 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:28,820 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,875 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:28,887 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:28,888 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:28,898 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-21 20:42:28,898 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-21 20:42:28,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,900 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,969 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,970 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,977 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,985 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:28,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-02-21 20:42:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:28,993 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:28,994 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-02-21 20:42:29,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796066787] [2021-02-21 20:42:29,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:29,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-02-21 20:42:29,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684805361] [2021-02-21 20:42:29,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-02-21 20:42:29,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-02-21 20:42:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-02-21 20:42:29,006 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 6 states. [2021-02-21 20:42:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:29,425 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-02-21 20:42:29,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-02-21 20:42:29,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-02-21 20:42:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:29,429 INFO L225 Difference]: With dead ends: 141 [2021-02-21 20:42:29,429 INFO L226 Difference]: Without dead ends: 114 [2021-02-21 20:42:29,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-02-21 20:42:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-02-21 20:42:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2021-02-21 20:42:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-02-21 20:42:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-02-21 20:42:29,447 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 78 [2021-02-21 20:42:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:29,447 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-02-21 20:42:29,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-02-21 20:42:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-02-21 20:42:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-02-21 20:42:29,449 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:29,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:42:29,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 20:42:29,450 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 95378343, now seen corresponding path program 1 times [2021-02-21 20:42:29,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:29,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914009164] [2021-02-21 20:42:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:29,481 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:29,486 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:29,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,540 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:29,545 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:29,546 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:29,554 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-21 20:42:29,555 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-21 20:42:29,555 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,556 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:29,581 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,582 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:29,618 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,618 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:29,625 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,625 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:29,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,632 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:29,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,657 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:29,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,667 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:29,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-21 20:42:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:29,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:29,680 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-02-21 20:42:29,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914009164] [2021-02-21 20:42:29,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:29,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-21 20:42:29,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589298807] [2021-02-21 20:42:29,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-21 20:42:29,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-21 20:42:29,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-02-21 20:42:29,694 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 9 states. [2021-02-21 20:42:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:30,270 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2021-02-21 20:42:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-21 20:42:30,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2021-02-21 20:42:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:30,272 INFO L225 Difference]: With dead ends: 169 [2021-02-21 20:42:30,273 INFO L226 Difference]: Without dead ends: 123 [2021-02-21 20:42:30,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-02-21 20:42:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-02-21 20:42:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2021-02-21 20:42:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-02-21 20:42:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2021-02-21 20:42:30,293 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 91 [2021-02-21 20:42:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:30,294 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2021-02-21 20:42:30,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-21 20:42:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-02-21 20:42:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-02-21 20:42:30,296 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:30,296 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, 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:42:30,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 20:42:30,297 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:30,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash 261527972, now seen corresponding path program 1 times [2021-02-21 20:42:30,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:30,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060989108] [2021-02-21 20:42:30,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:30,330 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:30,334 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:30,387 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,388 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,389 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:30,393 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:30,394 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:30,402 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:30,403 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:30,415 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:30,415 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:30,426 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-21 20:42:30,427 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-21 20:42:30,428 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,428 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:30,455 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,456 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:30,494 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,494 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:30,500 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,501 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:30,507 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,507 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:30,532 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,533 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-02-21 20:42:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:30,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:30,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-02-21 20:42:30,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060989108] [2021-02-21 20:42:30,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:30,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-21 20:42:30,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286130327] [2021-02-21 20:42:30,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-21 20:42:30,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:30,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-21 20:42:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-02-21 20:42:30,555 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2021-02-21 20:42:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:30,989 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2021-02-21 20:42:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-21 20:42:30,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2021-02-21 20:42:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:30,991 INFO L225 Difference]: With dead ends: 147 [2021-02-21 20:42:30,991 INFO L226 Difference]: Without dead ends: 120 [2021-02-21 20:42:30,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-02-21 20:42:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-02-21 20:42:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2021-02-21 20:42:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-02-21 20:42:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2021-02-21 20:42:31,012 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 98 [2021-02-21 20:42:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:31,012 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2021-02-21 20:42:31,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-21 20:42:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2021-02-21 20:42:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-02-21 20:42:31,014 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:31,014 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2021-02-21 20:42:31,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 20:42:31,015 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1290697615, now seen corresponding path program 2 times [2021-02-21 20:42:31,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:31,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183702218] [2021-02-21 20:42:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:31,045 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:31,048 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,099 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,100 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:31,105 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:31,105 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:31,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:31,121 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,122 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,182 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,200 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-21 20:42:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,228 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,229 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-21 20:42:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:31,237 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,237 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:31,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,238 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:31,246 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:31,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-02-21 20:42:31,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183702218] [2021-02-21 20:42:31,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:31,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-21 20:42:31,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271004494] [2021-02-21 20:42:31,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-21 20:42:31,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-21 20:42:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-02-21 20:42:31,285 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 10 states. [2021-02-21 20:42:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:31,816 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-02-21 20:42:31,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-21 20:42:31,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 111 [2021-02-21 20:42:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:31,818 INFO L225 Difference]: With dead ends: 157 [2021-02-21 20:42:31,818 INFO L226 Difference]: Without dead ends: 131 [2021-02-21 20:42:31,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-02-21 20:42:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-02-21 20:42:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-02-21 20:42:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-21 20:42:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2021-02-21 20:42:31,840 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 111 [2021-02-21 20:42:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:31,840 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2021-02-21 20:42:31,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-21 20:42:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2021-02-21 20:42:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-02-21 20:42:31,842 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:31,842 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:42:31,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 20:42:31,842 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:31,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1932003720, now seen corresponding path program 1 times [2021-02-21 20:42:31,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:31,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1969921898] [2021-02-21 20:42:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:31,874 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:31,877 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:32,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:32,061 WARN L141 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-02-21 20:42:32,062 WARN L147 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size 12 [2021-02-21 20:42:32,069 WARN L141 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-02-21 20:42:32,070 WARN L147 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size 12 [2021-02-21 20:42:32,078 WARN L141 QuantifierPusher]: treesize reduction 4, result has 84.6 percent of original size [2021-02-21 20:42:32,079 WARN L147 QuantifierPusher]: treesize reduction 4, result has 84.6 percent of original size 22 [2021-02-21 20:42:32,101 WARN L141 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size [2021-02-21 20:42:32,102 WARN L147 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size 26 [2021-02-21 20:42:32,132 WARN L141 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-02-21 20:42:32,134 WARN L147 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-02-21 20:42:32,163 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,166 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-02-21 20:42:32,187 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,189 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-02-21 20:42:32,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,206 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-02-21 20:42:32,234 WARN L141 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-02-21 20:42:32,234 WARN L147 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size 9 [2021-02-21 20:42:32,252 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,252 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:32,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:32,294 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,294 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:32,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:32,349 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,350 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:32,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:32,368 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,368 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:32,386 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,387 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:32,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,408 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-21 20:42:32,431 WARN L141 QuantifierPusher]: treesize reduction 5, result has 61.5 percent of original size [2021-02-21 20:42:32,432 WARN L147 QuantifierPusher]: treesize reduction 5, result has 61.5 percent of original size 8 [2021-02-21 20:42:32,458 WARN L141 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size [2021-02-21 20:42:32,459 WARN L147 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size 14 [2021-02-21 20:42:32,489 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,490 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-02-21 20:42:32,519 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,520 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-02-21 20:42:32,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:32,581 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,582 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:32,583 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,583 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:32,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,610 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:32,637 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,638 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:32,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:32,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:32,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,708 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:42:32,741 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,742 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:42:32,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:32,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:42:32,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:32,902 WARN L141 QuantifierPusher]: treesize reduction 12, result has 57.1 percent of original size [2021-02-21 20:42:32,903 WARN L147 QuantifierPusher]: treesize reduction 12, result has 57.1 percent of original size 16 [2021-02-21 20:42:32,951 WARN L141 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-02-21 20:42:32,952 WARN L147 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size 19 [2021-02-21 20:42:33,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-02-21 20:42:33,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,068 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-02-21 20:42:33,214 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,215 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-02-21 20:42:33,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-21 20:42:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:33,306 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,308 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-02-21 20:42:33,373 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,376 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-02-21 20:42:33,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-21 20:42:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:33,516 WARN L141 QuantifierPusher]: treesize reduction 12, result has 50.0 percent of original size [2021-02-21 20:42:33,517 WARN L147 QuantifierPusher]: treesize reduction 12, result has 50.0 percent of original size 12 [2021-02-21 20:42:33,568 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-21 20:42:33,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-21 20:42:33,701 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,702 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-21 20:42:33,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:33,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-21 20:42:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-02-21 20:42:33,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1969921898] [2021-02-21 20:42:33,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:33,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-02-21 20:42:33,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19177996] [2021-02-21 20:42:33,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-02-21 20:42:33,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:33,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-02-21 20:42:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1550, Unknown=0, NotChecked=0, Total=1640 [2021-02-21 20:42:33,912 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 41 states. [2021-02-21 20:42:36,486 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2021-02-21 20:42:36,718 WARN L202 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-02-21 20:42:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:40,284 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2021-02-21 20:42:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-02-21 20:42:40,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2021-02-21 20:42:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:40,287 INFO L225 Difference]: With dead ends: 218 [2021-02-21 20:42:40,287 INFO L226 Difference]: Without dead ends: 215 [2021-02-21 20:42:40,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=411, Invalid=5751, Unknown=0, NotChecked=0, Total=6162 [2021-02-21 20:42:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-02-21 20:42:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 156. [2021-02-21 20:42:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-02-21 20:42:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2021-02-21 20:42:40,325 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 118 [2021-02-21 20:42:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:40,326 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2021-02-21 20:42:40,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2021-02-21 20:42:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2021-02-21 20:42:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-21 20:42:40,328 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:40,328 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2021-02-21 20:42:40,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 20:42:40,328 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash -539169647, now seen corresponding path program 2 times [2021-02-21 20:42:40,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:40,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1055319127] [2021-02-21 20:42:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:40,354 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:40,357 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,400 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,401 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,402 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:40,406 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:40,406 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:40,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:40,418 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,418 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,442 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,443 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,479 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,480 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,485 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,486 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,491 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,491 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,512 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,514 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-21 20:42:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,519 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,520 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-21 20:42:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:40,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:40,542 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,547 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:40,556 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,562 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:40,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,573 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:40,588 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:40,588 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-02-21 20:42:40,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1055319127] [2021-02-21 20:42:40,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:40,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-21 20:42:40,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001893094] [2021-02-21 20:42:40,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-21 20:42:40,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-21 20:42:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-02-21 20:42:40,623 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 12 states. [2021-02-21 20:42:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:41,443 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2021-02-21 20:42:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-21 20:42:41,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2021-02-21 20:42:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:41,446 INFO L225 Difference]: With dead ends: 208 [2021-02-21 20:42:41,446 INFO L226 Difference]: Without dead ends: 164 [2021-02-21 20:42:41,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-02-21 20:42:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-02-21 20:42:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-02-21 20:42:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-02-21 20:42:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2021-02-21 20:42:41,476 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 125 [2021-02-21 20:42:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:41,477 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2021-02-21 20:42:41,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-21 20:42:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2021-02-21 20:42:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-21 20:42:41,479 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:41,479 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2021-02-21 20:42:41,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-21 20:42:41,480 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:41,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash -617921473, now seen corresponding path program 3 times [2021-02-21 20:42:41,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:41,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207270076] [2021-02-21 20:42:41,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:41,509 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:41,512 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,558 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,558 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,559 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,559 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:41,562 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:41,563 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:41,571 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:41,571 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:41,580 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:41,581 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:41,591 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-21 20:42:41,591 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-21 20:42:41,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,592 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,652 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,653 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-21 20:42:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,690 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,691 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,692 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:41,701 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,702 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:42:41,714 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,715 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:41,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-02-21 20:42:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:41,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:41,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-21 20:42:41,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207270076] [2021-02-21 20:42:41,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:41,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-21 20:42:41,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964403235] [2021-02-21 20:42:41,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-21 20:42:41,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-21 20:42:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-02-21 20:42:41,750 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 12 states. [2021-02-21 20:42:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:42,471 INFO L93 Difference]: Finished difference Result 235 states and 260 transitions. [2021-02-21 20:42:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-21 20:42:42,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2021-02-21 20:42:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:42,473 INFO L225 Difference]: With dead ends: 235 [2021-02-21 20:42:42,473 INFO L226 Difference]: Without dead ends: 159 [2021-02-21 20:42:42,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-02-21 20:42:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-02-21 20:42:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2021-02-21 20:42:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-02-21 20:42:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2021-02-21 20:42:42,502 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 125 [2021-02-21 20:42:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:42,503 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2021-02-21 20:42:42,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-21 20:42:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2021-02-21 20:42:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-21 20:42:42,505 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:42,505 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2021-02-21 20:42:42,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-21 20:42:42,505 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1043789163, now seen corresponding path program 4 times [2021-02-21 20:42:42,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:42,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465311289] [2021-02-21 20:42:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:42,532 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:42,535 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,576 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,577 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,578 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:42,581 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:42,582 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:42,590 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-21 20:42:42,590 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-21 20:42:42,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,591 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,614 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,615 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,644 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,644 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,650 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,654 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,678 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,679 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,679 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,680 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:42,687 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,688 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:42,697 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:42,708 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,708 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:42,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-02-21 20:42:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,724 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,725 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-02-21 20:42:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:42,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:42,729 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-21 20:42:42,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465311289] [2021-02-21 20:42:42,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:42,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 20:42:42,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417054207] [2021-02-21 20:42:42,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 20:42:42,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:42,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 20:42:42,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-02-21 20:42:42,748 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 11 states. [2021-02-21 20:42:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:43,652 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2021-02-21 20:42:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-02-21 20:42:43,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2021-02-21 20:42:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:43,654 INFO L225 Difference]: With dead ends: 220 [2021-02-21 20:42:43,654 INFO L226 Difference]: Without dead ends: 130 [2021-02-21 20:42:43,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-02-21 20:42:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-02-21 20:42:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2021-02-21 20:42:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-02-21 20:42:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2021-02-21 20:42:43,680 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 125 [2021-02-21 20:42:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:43,681 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2021-02-21 20:42:43,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 20:42:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2021-02-21 20:42:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-02-21 20:42:43,683 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:43,683 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2021-02-21 20:42:43,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-21 20:42:43,684 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash 480324644, now seen corresponding path program 1 times [2021-02-21 20:42:43,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:43,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555248735] [2021-02-21 20:42:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:43,714 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:43,717 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:43,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:43,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:43,783 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:43,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:43,786 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:43,787 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:43,794 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:43,798 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:43,807 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:43,808 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:43,818 WARN L141 QuantifierPusher]: treesize reduction 2, result has 85.7 percent of original size [2021-02-21 20:42:43,819 WARN L147 QuantifierPusher]: treesize reduction 2, result has 85.7 percent of original size 12 [2021-02-21 20:42:43,832 WARN L141 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-02-21 20:42:43,832 WARN L147 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size 14 [2021-02-21 20:42:43,846 WARN L141 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-02-21 20:42:43,847 WARN L147 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size 22 [2021-02-21 20:42:43,865 WARN L141 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-02-21 20:42:43,866 WARN L147 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size 24 [2021-02-21 20:42:43,883 WARN L141 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-02-21 20:42:43,884 WARN L147 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size 24 [2021-02-21 20:42:43,906 WARN L141 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-02-21 20:42:43,907 WARN L147 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size 22 [2021-02-21 20:42:43,932 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:43,933 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:42:43,951 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-21 20:42:43,952 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-21 20:42:43,968 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:43,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:43,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,007 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:44,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:44,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:44,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,064 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,065 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:44,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,098 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:44,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-21 20:42:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,110 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:42:44,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-21 20:42:44,153 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,154 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:42:44,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-21 20:42:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:44,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-21 20:42:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:44,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,193 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:42:44,219 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:42:44,239 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:44,240 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:42:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-02-21 20:42:44,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555248735] [2021-02-21 20:42:44,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:44,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-02-21 20:42:44,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312287107] [2021-02-21 20:42:44,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-02-21 20:42:44,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-02-21 20:42:44,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-02-21 20:42:44,304 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 23 states. [2021-02-21 20:42:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:46,794 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2021-02-21 20:42:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-21 20:42:46,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 135 [2021-02-21 20:42:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:46,796 INFO L225 Difference]: With dead ends: 170 [2021-02-21 20:42:46,796 INFO L226 Difference]: Without dead ends: 159 [2021-02-21 20:42:46,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2021-02-21 20:42:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-02-21 20:42:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2021-02-21 20:42:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-02-21 20:42:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2021-02-21 20:42:46,827 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 135 [2021-02-21 20:42:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:46,827 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2021-02-21 20:42:46,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-02-21 20:42:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2021-02-21 20:42:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-02-21 20:42:46,829 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:46,830 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-02-21 20:42:46,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-21 20:42:46,830 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2123308427, now seen corresponding path program 2 times [2021-02-21 20:42:46,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:46,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995181092] [2021-02-21 20:42:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:46,858 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:46,861 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:46,904 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:46,905 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:46,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:46,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:46,913 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:46,914 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:46,921 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:46,922 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:46,931 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:46,932 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:46,941 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:46,942 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:46,948 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:46,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:46,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:46,976 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:46,977 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:46,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,015 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,016 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,048 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,049 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-21 20:42:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,055 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,056 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-21 20:42:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,062 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-21 20:42:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,074 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,075 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:47,086 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,086 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:42:47,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-21 20:42:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-02-21 20:42:47,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995181092] [2021-02-21 20:42:47,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:47,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-21 20:42:47,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022178350] [2021-02-21 20:42:47,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-21 20:42:47,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:47,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-21 20:42:47,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-02-21 20:42:47,166 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 13 states. [2021-02-21 20:42:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:47,840 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2021-02-21 20:42:47,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-21 20:42:47,840 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 142 [2021-02-21 20:42:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:47,842 INFO L225 Difference]: With dead ends: 191 [2021-02-21 20:42:47,842 INFO L226 Difference]: Without dead ends: 135 [2021-02-21 20:42:47,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-02-21 20:42:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-02-21 20:42:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-02-21 20:42:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-02-21 20:42:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2021-02-21 20:42:47,871 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 142 [2021-02-21 20:42:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:47,872 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2021-02-21 20:42:47,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-21 20:42:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2021-02-21 20:42:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-02-21 20:42:47,874 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:42:47,875 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-02-21 20:42:47,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-21 20:42:47,875 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:42:47,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:42:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1657400056, now seen corresponding path program 3 times [2021-02-21 20:42:47,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:42:47,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265905862] [2021-02-21 20:42:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:42:47,906 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-21 20:42:47,909 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:42:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:47,961 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:47,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:47,963 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-21 20:42:47,967 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:47,968 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:47,975 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:47,976 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:47,984 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:47,985 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:47,994 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:47,995 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:48,006 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-21 20:42:48,007 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-21 20:42:48,021 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-21 20:42:48,022 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-21 20:42:48,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:42:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,048 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,048 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-21 20:42:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,083 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-21 20:42:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,089 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-21 20:42:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-21 20:42:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,120 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,121 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-21 20:42:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-21 20:42:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-21 20:42:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,137 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-02-21 20:42:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:42:48,141 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:42:48,142 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:42:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-02-21 20:42:48,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265905862] [2021-02-21 20:42:48,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:42:48,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-21 20:42:48,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733992795] [2021-02-21 20:42:48,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-21 20:42:48,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:42:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-21 20:42:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-02-21 20:42:48,174 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 11 states. [2021-02-21 20:42:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:42:48,796 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2021-02-21 20:42:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-21 20:42:48,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2021-02-21 20:42:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:42:48,797 INFO L225 Difference]: With dead ends: 160 [2021-02-21 20:42:48,797 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 20:42:48,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-02-21 20:42:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 20:42:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 20:42:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 20:42:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 20:42:48,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2021-02-21 20:42:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:42:48,799 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 20:42:48,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-21 20:42:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 20:42:48,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 20:42:48,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-21 20:42:48,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 20:42:50,662 WARN L202 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2021-02-21 20:42:50,767 WARN L202 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2021-02-21 20:42:50,874 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2021-02-21 20:42:51,144 WARN L202 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2021-02-21 20:42:51,426 WARN L202 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-21 20:42:51,716 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2021-02-21 20:42:51,835 WARN L202 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2021-02-21 20:42:52,108 WARN L202 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-21 20:42:52,386 WARN L202 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-02-21 20:42:52,612 WARN L202 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-21 20:42:52,900 WARN L202 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-02-21 20:42:53,039 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-02-21 20:42:53,387 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-02-21 20:42:53,532 WARN L202 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2021-02-21 20:42:53,815 WARN L202 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2021-02-21 20:42:54,009 WARN L202 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-02-21 20:42:54,207 WARN L202 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-02-21 20:42:54,348 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2021-02-21 20:42:54,587 WARN L202 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2021-02-21 20:42:54,789 WARN L202 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2021-02-21 20:42:55,036 WARN L202 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2021-02-21 20:42:55,590 WARN L202 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2021-02-21 20:42:55,728 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2021-02-21 20:42:56,002 WARN L202 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-02-21 20:42:56,170 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2021-02-21 20:42:56,334 WARN L202 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-21 20:42:56,684 WARN L202 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2021-02-21 20:42:56,966 WARN L202 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-02-21 20:42:57,505 WARN L202 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-21 20:42:57,511 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-02-21 20:42:57,511 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-02-21 20:42:57,511 INFO L189 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-02-21 20:42:57,511 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-02-21 20:42:57,511 INFO L189 CegarLoopUtils]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-02-21 20:42:57,512 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point L12-1(line 12) the Hoare annotation is: true [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point L12-2(line 12) the Hoare annotation is: true [2021-02-21 20:42:57,512 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |old(#t~string1.offset)| |#t~string1.offset|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point L12-3(line 12) the Hoare annotation is: true [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:42:57,512 INFO L192 CegarLoopUtils]: At program point myexitENTRY(lines 571 573) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L572(line 572) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L189 CegarLoopUtils]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L595(line 595) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L594(line 594) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L595-1(line 595) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L594-1(line 594) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L594-2(line 594) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point L593-3(lines 592 598) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L192 CegarLoopUtils]: At program point sll_destroyEXIT(lines 592 598) the Hoare annotation is: true [2021-02-21 20:42:57,513 INFO L185 CegarLoopUtils]: At program point sll_destroyENTRY(lines 592 598) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-02-21 20:42:57,514 INFO L185 CegarLoopUtils]: At program point L609(line 609) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse2 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 (<= 1 sll_update_at_~index) .cse1 (= |sll_update_at_#in~index| sll_update_at_~index) .cse2 (let ((.cse3 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse3 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (= sll_update_at_~data |sll_update_at_#in~data|) (= .cse3 sll_update_at_~head.base))))) (and .cse0 .cse1 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse2 (<= 2 |sll_update_at_#in~index|)))) [2021-02-21 20:42:57,514 INFO L185 CegarLoopUtils]: At program point L608(line 608) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (or (and (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |sll_update_at_#in~index|)) (and (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|))) (<= 1 |sll_update_at_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2021-02-21 20:42:57,515 INFO L185 CegarLoopUtils]: At program point L609-1(line 609) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (<= |sll_update_at_#t~post13| |sll_update_at_#in~index|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 .cse2 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse3 (<= 2 |sll_update_at_#in~index|)) (and .cse0 (<= 1 sll_update_at_~index) .cse1 .cse2 (= |sll_update_at_#in~index| sll_update_at_~index) .cse3 (let ((.cse4 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse4 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (= sll_update_at_~data |sll_update_at_#in~data|) (= .cse4 sll_update_at_~head.base))))))) [2021-02-21 20:42:57,515 INFO L185 CegarLoopUtils]: At program point L608-1(line 608) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (or (and (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) (<= 2 |sll_update_at_#in~index|)) (and (or (and (= |sll_update_at_#t~mem12.base| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4)) (= |sll_update_at_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4))) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|)) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|))) (<= 1 |sll_update_at_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2021-02-21 20:42:57,515 INFO L185 CegarLoopUtils]: At program point L609-2(line 609) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (<= |sll_update_at_#t~post13| |sll_update_at_#in~index|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse4 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 |sll_update_at_#in~index|)) (and .cse0 .cse1 .cse2 (<= 1 |sll_update_at_#in~index|) .cse3 .cse4 (let ((.cse5 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse5 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (= sll_update_at_~data |sll_update_at_#in~data|) (= .cse5 sll_update_at_~head.base))))))) [2021-02-21 20:42:57,515 INFO L185 CegarLoopUtils]: At program point L606(lines 606 612) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |#memory_int| |old(#memory_int)|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2021-02-21 20:42:57,515 INFO L185 CegarLoopUtils]: At program point L608-2(line 608) the Hoare annotation is: (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse6 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (let ((.cse4 (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) (.cse3 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4)) (.cse1 (<= (+ |sll_update_at_#in~head.offset| 1) 0)) (.cse2 (<= 1 |sll_update_at_#in~head.offset|))) (and .cse0 (or .cse1 .cse2 (and (= sll_update_at_~data |sll_update_at_#in~data|) (= |sll_update_at_#t~mem12.base| .cse3) (= |sll_update_at_#t~mem12.offset| .cse4))) (<= 1 sll_update_at_~index) .cse5 (= |sll_update_at_#in~index| sll_update_at_~index) .cse6 (or (= .cse3 |sll_update_at_#in~head.base|) (and (= sll_update_at_~head.offset .cse4) (= .cse3 sll_update_at_~head.base)) .cse1 .cse2))) (and .cse0 .cse5 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse6 (<= 2 |sll_update_at_#in~index|)))) [2021-02-21 20:42:57,516 INFO L185 CegarLoopUtils]: At program point L606-1(lines 606 612) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |#memory_int| |old(#memory_int)|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2021-02-21 20:42:57,516 INFO L185 CegarLoopUtils]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse5 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse2 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 (<= 1 |sll_update_at_#in~index|) .cse2 .cse3 (let ((.cse4 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse4 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) .cse5 (= .cse4 sll_update_at_~head.base))))) (and .cse0 (= |sll_update_at_#in~head.base| sll_update_at_~head.base) .cse1 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) .cse5 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= 2 |sll_update_at_#in~index|)))) [2021-02-21 20:42:57,516 INFO L185 CegarLoopUtils]: At program point L607-3(lines 607 610) the Hoare annotation is: (let ((.cse5 (= sll_update_at_~data |sll_update_at_#in~data|))) (and (let ((.cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (= |#memory_int| |old(#memory_int)|)) (.cse3 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|)) (.cse2 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (and .cse0 .cse1 (<= |sll_update_at_#in~index| 0) .cse2) (and .cse0 .cse1 .cse3 .cse2 (let ((.cse4 (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) 4))) (or (= .cse4 |sll_update_at_#in~head.base|) (<= (+ |sll_update_at_#in~head.offset| 1) 0) (<= 1 |sll_update_at_#in~head.offset|) (and (= sll_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4)) .cse5 (= .cse4 sll_update_at_~head.base))))) (and .cse0 .cse1 .cse3 .cse2 (<= 2 |sll_update_at_#in~index|)))) (or (<= 1 |sll_update_at_#in~index|) (and (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) .cse5)))) [2021-02-21 20:42:57,517 INFO L185 CegarLoopUtils]: At program point sll_update_atFINAL(lines 606 612) the Hoare annotation is: (let ((.cse2 (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|)) (.cse3 (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|))) (let ((.cse4 (select .cse3 4)) (.cse6 (select .cse2 4)) (.cse5 (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4))) (and (let ((.cse0 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|))) (or (and .cse0 (<= 2 |sll_update_at_#in~index|)) (<= |sll_update_at_#in~index| 0) (and (or (<= (+ |sll_update_at_#in~head.offset| 1) 0) (let ((.cse1 (= |sll_update_at_#in~head.base| .cse6))) (and (or .cse1 (= .cse2 .cse3)) (or .cse1 (= (select (select |#memory_int| .cse4) .cse5) |sll_update_at_#in~data|)))) (<= 1 |sll_update_at_#in~head.offset|)) .cse0))) (or (and (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (or (= |sll_update_at_#in~head.offset| 4) (let ((.cse7 (@diff |old(#memory_int)| |#memory_int|))) (and (= .cse4 .cse6) (or (= |#memory_int| |old(#memory_int)|) (= .cse7 |sll_update_at_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) 4) .cse5) (= (store |old(#memory_int)| .cse7 (select |#memory_int| .cse7)) |#memory_int|)))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|)) (<= 1 |sll_update_at_#in~index|))))) [2021-02-21 20:42:57,517 INFO L185 CegarLoopUtils]: At program point sll_update_atEXIT(lines 606 612) the Hoare annotation is: (let ((.cse2 (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|)) (.cse3 (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|))) (let ((.cse4 (select .cse3 4)) (.cse6 (select .cse2 4)) (.cse5 (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) 4))) (and (let ((.cse0 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|))) (or (and .cse0 (<= 2 |sll_update_at_#in~index|)) (<= |sll_update_at_#in~index| 0) (and (or (<= (+ |sll_update_at_#in~head.offset| 1) 0) (let ((.cse1 (= |sll_update_at_#in~head.base| .cse6))) (and (or .cse1 (= .cse2 .cse3)) (or .cse1 (= (select (select |#memory_int| .cse4) .cse5) |sll_update_at_#in~data|)))) (<= 1 |sll_update_at_#in~head.offset|)) .cse0))) (or (and (= |sll_update_at_#in~head.base| sll_update_at_~head.base) (or (= |sll_update_at_#in~head.offset| 4) (let ((.cse7 (@diff |old(#memory_int)| |#memory_int|))) (and (= .cse4 .cse6) (or (= |#memory_int| |old(#memory_int)|) (= .cse7 |sll_update_at_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.offset)| |sll_update_at_#in~head.base|) 4) .cse5) (= (store |old(#memory_int)| .cse7 (select |#memory_int| .cse7)) |#memory_int|)))) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~data |sll_update_at_#in~data|) (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|)) (<= 1 |sll_update_at_#in~index|))))) [2021-02-21 20:42:57,517 INFO L185 CegarLoopUtils]: At program point sll_update_atENTRY(lines 606 612) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2021-02-21 20:42:57,517 INFO L189 CegarLoopUtils]: For program point __bswap_32ENTRY(lines 74 78) no Hoare annotation was computed. [2021-02-21 20:42:57,517 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-02-21 20:42:57,517 INFO L189 CegarLoopUtils]: For program point L77-1(line 77) no Hoare annotation was computed. [2021-02-21 20:42:57,518 INFO L189 CegarLoopUtils]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2021-02-21 20:42:57,518 INFO L189 CegarLoopUtils]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2021-02-21 20:42:57,518 INFO L185 CegarLoopUtils]: At program point sll_createEXIT(lines 583 591) the Hoare annotation is: (or (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) (= (select |#valid| sll_create_~head~0.base) 1) (= sll_create_~head~0.offset 0) (= |sll_create_#res.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4) |sll_create_#res.base|))) (and (<= |sll_create_#in~len| 1) (<= |sll_create_#in~len| (+ sll_create_~len 1)))) [2021-02-21 20:42:57,518 INFO L185 CegarLoopUtils]: At program point sll_createENTRY(lines 583 591) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,518 INFO L185 CegarLoopUtils]: At program point L587(line 587) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base)))) (or (and .cse0 (= |sll_create_#in~len| sll_create_~len)) (and .cse0 (= sll_create_~new_head~0.offset 0) (not (= sll_create_~head~0.base sll_create_~new_head~0.base))))) [2021-02-21 20:42:57,518 INFO L185 CegarLoopUtils]: At program point L586(line 586) the Hoare annotation is: (or (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (= (select |#valid| sll_create_~head~0.base) 1)) (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|))) [2021-02-21 20:42:57,518 INFO L185 CegarLoopUtils]: At program point L587-1(line 587) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base)))) (or (and .cse0 (= |sll_create_#in~len| sll_create_~len)) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (= sll_create_~new_head~0.offset 0) (not (= sll_create_~head~0.base sll_create_~new_head~0.base))))) [2021-02-21 20:42:57,519 INFO L185 CegarLoopUtils]: At program point L586-1(line 586) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |sll_create_#t~ret7.base|) 1))) (or (and .cse0 (= |sll_create_#t~ret7.offset| 0) (not (= sll_create_~head~0.base |sll_create_#t~ret7.base|))) (and .cse0 (= |sll_create_#in~len| sll_create_~len)))) [2021-02-21 20:42:57,519 INFO L185 CegarLoopUtils]: At program point L584(line 584) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,519 INFO L185 CegarLoopUtils]: At program point L586-2(line 586) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |sll_create_#t~ret7.base|) 1)) (.cse1 (= 1 (select |#valid| sll_create_~new_head~0.base)))) (or (and .cse0 .cse1 (= |sll_create_#t~ret7.offset| 0) (= sll_create_~new_head~0.offset 0) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base |sll_create_#t~ret7.base|))) (and .cse0 .cse1 (= |sll_create_#in~len| sll_create_~len)))) [2021-02-21 20:42:57,519 INFO L185 CegarLoopUtils]: At program point L583(lines 583 591) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,519 INFO L185 CegarLoopUtils]: At program point L585-2(lines 585 589) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 (= |sll_create_#in~len| sll_create_~len) .cse1) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)))) [2021-02-21 20:42:57,520 INFO L185 CegarLoopUtils]: At program point L585-3(line 585) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)) (and .cse0 (<= |sll_create_#in~len| |sll_create_#t~post6|) (= |sll_create_#in~len| sll_create_~len) .cse1))) [2021-02-21 20:42:57,520 INFO L185 CegarLoopUtils]: At program point L585-4(line 585) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)) (and .cse0 (<= |sll_create_#in~len| |sll_create_#t~post6|) .cse1 (<= |sll_create_#in~len| (+ sll_create_~len 1))))) [2021-02-21 20:42:57,520 INFO L185 CegarLoopUtils]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| sll_create_~new_head~0.base))) (.cse1 (= (select |#valid| sll_create_~head~0.base) 1))) (or (and .cse0 .cse1 (<= |sll_create_#in~len| (+ sll_create_~len 1))) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) .cse1 (= sll_create_~head~0.offset 0)) (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)))) [2021-02-21 20:42:57,520 INFO L185 CegarLoopUtils]: At program point L585-6(lines 585 589) the Hoare annotation is: (or (and (<= |sll_create_#in~len| 1) (<= |sll_create_#in~len| (+ sll_create_~len 1))) (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) (= (select |#valid| sll_create_~head~0.base) 1) (= sll_create_~head~0.offset 0))) [2021-02-21 20:42:57,520 INFO L185 CegarLoopUtils]: At program point sll_createFINAL(lines 583 591) the Hoare annotation is: (or (and (= 1 (select |#valid| sll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) (+ sll_create_~new_head~0.offset 4)) sll_create_~new_head~0.base)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) (= sll_create_~new_head~0.offset 0) (= (select |#valid| sll_create_~head~0.base) 1) (= sll_create_~head~0.offset 0) (= |sll_create_#res.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 4) |sll_create_#res.base|))) (and (<= |sll_create_#in~len| 1) (<= |sll_create_#in~len| (+ sll_create_~len 1)))) [2021-02-21 20:42:57,521 INFO L189 CegarLoopUtils]: For program point __bswap_64ENTRY(lines 79 83) no Hoare annotation was computed. [2021-02-21 20:42:57,521 INFO L189 CegarLoopUtils]: For program point L82-1(line 82) no Hoare annotation was computed. [2021-02-21 20:42:57,521 INFO L189 CegarLoopUtils]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2021-02-21 20:42:57,521 INFO L189 CegarLoopUtils]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2021-02-21 20:42:57,521 INFO L189 CegarLoopUtils]: For program point L82(line 82) no Hoare annotation was computed. [2021-02-21 20:42:57,521 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:42:57,521 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:42:57,521 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 20:42:57,522 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 20:42:57,522 INFO L192 CegarLoopUtils]: At program point sll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2021-02-21 20:42:57,522 INFO L185 CegarLoopUtils]: At program point L604(line 604) the Hoare annotation is: (let ((.cse0 (<= 1 |sll_get_data_at_#in~index|))) (and (or (and (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#t~mem11|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse0) (let ((.cse1 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse1 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse4 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse3 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse2 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse5 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and (or .cse2 (= (select (select |#memory_int| .cse3) .cse4) |sll_get_data_at_#t~mem11|) .cse5) .cse1 (or (and (= sll_get_data_at_~head.offset .cse4) (= sll_get_data_at_~head.base .cse3)) .cse2 .cse5) .cse0)) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))))) [2021-02-21 20:42:57,522 INFO L185 CegarLoopUtils]: At program point L604-1(line 604) the Hoare annotation is: (let ((.cse6 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse5 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse4 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4))) (let ((.cse2 (select (select |#memory_int| .cse5) .cse4)) (.cse1 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse3 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and (or .cse1 (= .cse2 |sll_get_data_at_#t~mem11|) .cse3) .cse0 (or .cse1 (= .cse2 |sll_get_data_at_#res|) .cse3) (or (and (= sll_get_data_at_~head.offset .cse4) (= sll_get_data_at_~head.base .cse5)) .cse1 .cse3) .cse6))) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (let ((.cse7 (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|))) (and (= .cse7 |sll_get_data_at_#t~mem11|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= .cse7 |sll_get_data_at_#res|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) .cse6))) [2021-02-21 20:42:57,523 INFO L185 CegarLoopUtils]: At program point L602(line 602) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 sll_get_data_at_~index))) [2021-02-21 20:42:57,523 INFO L185 CegarLoopUtils]: At program point L601(line 601) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= 1 sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) [2021-02-21 20:42:57,523 INFO L185 CegarLoopUtils]: At program point L602-1(line 602) the Hoare annotation is: (let ((.cse0 (<= |sll_get_data_at_#t~post10| |sll_get_data_at_#in~index|))) (or (and .cse0 (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 sll_get_data_at_~index)) (and .cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)))) [2021-02-21 20:42:57,523 INFO L185 CegarLoopUtils]: At program point sll_get_data_atFINAL(lines 599 605) the Hoare annotation is: (let ((.cse5 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse3 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse2 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse1 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse4 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and .cse0 (or .cse1 (= (select (select |#memory_int| .cse2) .cse3) |sll_get_data_at_#res|) .cse4) (or (and (= sll_get_data_at_~head.offset .cse3) (= sll_get_data_at_~head.base .cse2)) .cse1 .cse4) .cse5)) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse5))) [2021-02-21 20:42:57,523 INFO L185 CegarLoopUtils]: At program point L601-1(line 601) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (and (or (<= 1 |sll_get_data_at_#in~head.offset|) (and (= |sll_get_data_at_#t~mem9.base| (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (= |sll_get_data_at_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4))) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (<= 1 sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|))) [2021-02-21 20:42:57,524 INFO L185 CegarLoopUtils]: At program point L602-2(line 602) the Hoare annotation is: (let ((.cse0 (<= |sll_get_data_at_#t~post10| |sll_get_data_at_#in~index|)) (.cse1 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 .cse1 (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 |sll_get_data_at_#in~index|)) (and .cse0 .cse1 (<= 2 |sll_get_data_at_#in~index|)))) [2021-02-21 20:42:57,524 INFO L185 CegarLoopUtils]: At program point L599(lines 599 605) the Hoare annotation is: (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) [2021-02-21 20:42:57,524 INFO L185 CegarLoopUtils]: At program point L601-2(line 601) the Hoare annotation is: (or (and (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|) (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse2 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse1 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse0 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse3 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and (or .cse0 (and (= |sll_get_data_at_#t~mem9.base| .cse1) (= |sll_get_data_at_#t~mem9.offset| .cse2)) .cse3) (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (or (and (= sll_get_data_at_~head.offset .cse2) (= sll_get_data_at_~head.base .cse1)) .cse0 .cse3) (<= 1 sll_get_data_at_~index)))) [2021-02-21 20:42:57,524 INFO L185 CegarLoopUtils]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (and .cse0 (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) (<= 1 |sll_get_data_at_#in~index|)) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)))) [2021-02-21 20:42:57,524 INFO L185 CegarLoopUtils]: At program point L600-3(lines 600 603) the Hoare annotation is: (let ((.cse1 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (and .cse0 (or (and (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4))) (<= 1 |sll_get_data_at_#in~head.offset|) (<= (+ |sll_get_data_at_#in~head.offset| 1) 0)) .cse1) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse1))) [2021-02-21 20:42:57,525 INFO L185 CegarLoopUtils]: At program point sll_get_data_atEXIT(lines 599 605) the Hoare annotation is: (let ((.cse5 (<= 1 |sll_get_data_at_#in~index|))) (and (let ((.cse0 (<= (+ sll_get_data_at_~index 1) |sll_get_data_at_#in~index|))) (or (and .cse0 (<= 2 |sll_get_data_at_#in~index|)) (let ((.cse3 (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4)) (.cse2 (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (.cse1 (<= 1 |sll_get_data_at_#in~head.offset|)) (.cse4 (<= (+ |sll_get_data_at_#in~head.offset| 1) 0))) (and .cse0 (or .cse1 (= (select (select |#memory_int| .cse2) .cse3) |sll_get_data_at_#res|) .cse4) (or (and (= sll_get_data_at_~head.offset .cse3) (= sll_get_data_at_~head.base .cse2)) .cse1 .cse4) .cse5)) (and (<= |sll_get_data_at_#in~index| 0) (= |sll_get_data_at_#in~index| sll_get_data_at_~index)))) (or (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) .cse5))) [2021-02-21 20:42:57,525 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 613 632) the Hoare annotation is: true [2021-02-21 20:42:57,525 INFO L185 CegarLoopUtils]: At program point L630(line 630) the Hoare annotation is: false [2021-02-21 20:42:57,525 INFO L185 CegarLoopUtils]: At program point L622-2(lines 622 627) the Hoare annotation is: (let ((.cse3 (+ main_~i~0 2)) (.cse7 (* 2 main_~len~0)) (.cse6 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= main_~len~0 .cse6)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse7)) (.cse5 (<= main_~len~0 .cse3))) (or (and .cse0 .cse1 .cse2 (<= .cse3 main_~len~0) .cse4 .cse5 (<= (+ .cse6 2) .cse7)) (and .cse0 .cse1 (<= (+ main_~i~0 1) main_~len~0) .cse2 .cse4 (<= (+ .cse6 1) (+ main_~i~0 main_~len~0)) .cse5)))) [2021-02-21 20:42:57,526 INFO L185 CegarLoopUtils]: At program point L622-3(line 622) the Hoare annotation is: (let ((.cse7 (+ main_~i~0 2)) (.cse8 (* 2 main_~len~0)) (.cse6 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= main_~len~0 .cse6)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse8)) (.cse5 (<= main_~len~0 .cse7))) (or (let ((.cse2 (+ .cse6 1))) (and .cse0 .cse1 (<= .cse2 (+ main_~len~0 |main_#t~post16|)) (<= (+ main_~i~0 1) main_~len~0) .cse3 .cse4 (<= (+ |main_#t~post16| 1) main_~len~0) (<= .cse2 (+ main_~i~0 main_~len~0)) .cse5)) (and .cse0 .cse1 .cse3 (<= .cse7 main_~len~0) .cse4 .cse5 (<= (+ |main_#t~post16| 2) main_~len~0) (<= (+ .cse6 2) .cse8))))) [2021-02-21 20:42:57,526 INFO L185 CegarLoopUtils]: At program point L618(line 618) the Hoare annotation is: (and (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)) (= main_~s~0.offset 0)) [2021-02-21 20:42:57,526 INFO L185 CegarLoopUtils]: At program point L622-4(line 622) the Hoare annotation is: (let ((.cse4 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse3 (<= (+ main_~new_data~0 2) .cse4)) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (<= (+ .cse1 1) (+ main_~len~0 |main_#t~post16|)) (<= (+ main_~i~0 2) .cse1) .cse2 .cse3 (<= 0 main_~i~0) (<= (+ |main_#t~post16| 1) main_~len~0)) (and .cse0 (<= main_~len~0 .cse1) .cse2 .cse3 (<= (+ |main_#t~post16| 2) main_~len~0) (<= (+ .cse1 2) .cse4) (<= (+ main_~i~0 3) main_~len~0))))) [2021-02-21 20:42:57,526 INFO L185 CegarLoopUtils]: At program point L622-5(lines 622 627) the Hoare annotation is: (let ((.cse8 (* 2 main_~len~0)) (.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (<= main_~len~0 .cse7)) (.cse0 (= main_~len~0 2)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse8)) (.cse9 (<= (+ .cse7 2) .cse8))) (or (let ((.cse2 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse5 (+ main_~i~0 main_~len~0)) (.cse6 (select (select |#memory_int| .cse2) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 .cse1 (not (= .cse2 main_~s~0.base)) .cse3 .cse4 (<= .cse5 .cse6) (<= (+ .cse7 1) .cse5) (<= (+ .cse6 1) .cse8) (= main_~s~0.offset 0)))) (and .cse0 .cse1 .cse3 .cse4 .cse9 (<= (+ main_~i~0 3) main_~len~0)) (and .cse0 (<= (+ main_~i~0 2) .cse7) .cse3 .cse4 (<= 0 main_~i~0) .cse9)))) [2021-02-21 20:42:57,526 INFO L192 CegarLoopUtils]: At program point L622-6(lines 622 627) the Hoare annotation is: true [2021-02-21 20:42:57,527 INFO L185 CegarLoopUtils]: At program point L618-3(line 618) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse5 (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse9 (+ .cse5 1)) (.cse4 (* 2 main_~len~0)) (.cse6 (+ |main_#t~post15| 1))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= .cse6 main_~len~0)) (.cse2 (not (= .cse11 main_~s~0.base))) (.cse7 (<= .cse9 .cse4)) (.cse8 (= main_~s~0.offset 0))) (or (let ((.cse3 (+ main_~new_data~0 1))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) (<= main_~len~0 (+ main_~i~0 1)) (<= (+ main_~i~0 main_~len~0) .cse5) (<= main_~len~0 .cse6) (<= .cse4 .cse3) .cse7 .cse8)) (let ((.cse10 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and (<= .cse4 .cse9) .cse0 .cse1 .cse2 (<= (+ main_~i~0 2) .cse10) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse4) (<= 0 main_~i~0) .cse7 (<= (+ .cse10 2) .cse4) .cse8))))))) [2021-02-21 20:42:57,527 INFO L185 CegarLoopUtils]: At program point L618-4(line 618) the Hoare annotation is: (let ((.cse13 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse11 (+ main_~i~0 2)) (.cse10 (+ |main_#t~post15| 1)) (.cse6 (* 2 main_~len~0)) (.cse12 (+ (select (select |#memory_int| .cse13) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= .cse6 .cse12)) (.cse3 (<= .cse10 main_~len~0)) (.cse4 (not (= .cse13 main_~s~0.base))) (.cse5 (<= .cse11 main_~len~0)) (.cse7 (<= .cse12 .cse6)) (.cse8 (= main_~s~0.offset 0))) (or (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 .cse1 (<= main_~len~0 .cse2) .cse3 .cse4 .cse5 (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse6) .cse7 (<= (+ .cse2 2) .cse6) .cse8)) (let ((.cse9 (+ main_~new_data~0 1))) (and .cse0 .cse1 .cse3 .cse4 (<= .cse9 .cse6) .cse5 (<= main_~len~0 .cse10) (<= .cse6 .cse9) (<= main_~len~0 .cse11) .cse7 .cse8)))))) [2021-02-21 20:42:57,527 INFO L185 CegarLoopUtils]: At program point L618-5(lines 618 621) the Hoare annotation is: (let ((.cse12 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (+ main_~i~0 2)) (.cse5 (* 2 main_~len~0)) (.cse11 (+ (select (select |#memory_int| .cse12) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= .cse5 .cse11)) (.cse3 (not (= .cse12 main_~s~0.base))) (.cse4 (<= .cse10 main_~len~0)) (.cse6 (<= .cse11 .cse5)) (.cse7 (= main_~s~0.offset 0))) (or (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and .cse0 .cse1 (<= main_~len~0 .cse2) .cse3 .cse4 (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse5) .cse6 (<= (+ .cse2 2) .cse5) .cse7)) (let ((.cse8 (+ main_~i~0 1))) (and .cse0 .cse3 (<= .cse8 main_~len~0) (<= main_~len~0 .cse8) .cse7)) (let ((.cse9 (+ main_~new_data~0 1))) (and .cse0 .cse1 .cse3 (<= .cse9 .cse5) .cse4 (<= .cse5 .cse9) (<= main_~len~0 .cse10) .cse6 .cse7)))))) [2021-02-21 20:42:57,527 INFO L185 CegarLoopUtils]: At program point L618-6(lines 618 621) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse1 (+ (select (select |#memory_int| .cse3) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse0 (* 2 main_~len~0))) (and (= main_~len~0 2) (<= .cse0 .cse1) (<= main_~len~0 .cse2) (not (= .cse3 main_~s~0.base)) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse0) (<= .cse1 .cse0) (<= (+ .cse2 2) .cse0) (= main_~s~0.offset 0) (<= (+ main_~i~0 3) main_~len~0)))) [2021-02-21 20:42:57,528 INFO L185 CegarLoopUtils]: At program point L631(line 631) the Hoare annotation is: false [2021-02-21 20:42:57,528 INFO L185 CegarLoopUtils]: At program point L623(line 623) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse6 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse6)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse5 (<= main_~len~0 .cse1))) (or (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 (<= (+ .cse2 2) .cse6)) (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse8 (+ main_~i~0 main_~len~0)) (.cse9 (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 (<= main_~len~0 .cse2) (not (= .cse7 main_~s~0.base)) .cse3 .cse4 (<= .cse8 .cse9) (<= (+ .cse2 1) .cse8) .cse5 (<= (+ .cse9 1) .cse6) (= main_~s~0.offset 0))))))) [2021-02-21 20:42:57,528 INFO L185 CegarLoopUtils]: At program point L619(line 619) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse2 (= main_~len~0 2)) (.cse3 (not (= .cse6 main_~s~0.base))) (.cse5 (= main_~s~0.offset 0))) (or (let ((.cse4 (+ main_~i~0 2)) (.cse1 (+ (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1)) (.cse0 (* 2 main_~len~0))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse4 main_~len~0) (<= main_~len~0 .cse4) (<= .cse1 .cse0) .cse5)) (let ((.cse7 (+ main_~i~0 1))) (and .cse2 .cse3 (<= .cse7 main_~len~0) (<= main_~len~0 .cse7) .cse5))))) [2021-02-21 20:42:57,528 INFO L185 CegarLoopUtils]: At program point L615(line 615) the Hoare annotation is: (and (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,528 INFO L192 CegarLoopUtils]: At program point L628(line 628) the Hoare annotation is: true [2021-02-21 20:42:57,529 INFO L185 CegarLoopUtils]: At program point L624(line 624) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse6 (* 2 main_~len~0))) (let ((.cse0 (= main_~len~0 2)) (.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (<= (+ main_~new_data~0 2) .cse6)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse5 (<= main_~len~0 .cse1))) (or (and .cse0 (<= .cse1 .cse2) (<= .cse2 main_~expected~0) .cse3 .cse4 .cse5 (<= (+ .cse2 2) .cse6) (<= main_~expected~0 .cse2)) (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse9 (+ main_~i~0 main_~len~0)) (.cse8 (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 (<= main_~len~0 .cse2) (not (= .cse7 main_~s~0.base)) (<= .cse8 main_~expected~0) .cse3 .cse4 (<= .cse9 .cse8) (<= main_~expected~0 .cse8) (<= (+ .cse2 1) .cse9) .cse5 (<= (+ .cse8 1) .cse6) (= main_~s~0.offset 0))))))) [2021-02-21 20:42:57,529 INFO L185 CegarLoopUtils]: At program point L624-1(line 624) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse8 (* 2 main_~len~0))) (let ((.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse5 (<= (+ main_~new_data~0 2) .cse8)) (.cse7 (<= main_~expected~0 |main_#t~ret17|)) (.cse6 (<= main_~len~0 .cse1)) (.cse0 (= main_~len~0 2)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (<= .cse1 .cse2) (<= .cse2 main_~expected~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ .cse2 2) .cse8) (<= main_~expected~0 .cse2)) (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse9 (+ main_~i~0 main_~len~0))) (and (<= main_~len~0 .cse2) .cse3 .cse4 .cse5 (<= .cse9 .cse10) .cse7 .cse6 (<= (+ .cse10 1) .cse8) .cse0 (not (= .cse11 main_~s~0.base)) (<= .cse10 main_~expected~0) (<= main_~expected~0 .cse10) (<= (+ .cse2 1) .cse9) (= main_~s~0.offset 0))))))) [2021-02-21 20:42:57,529 INFO L185 CegarLoopUtils]: At program point L624-2(lines 624 626) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 2)) (.cse8 (* 2 main_~len~0))) (let ((.cse3 (<= main_~len~0 main_~new_data~0)) (.cse4 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse5 (<= (+ main_~new_data~0 2) .cse8)) (.cse7 (<= main_~expected~0 |main_#t~ret17|)) (.cse6 (<= main_~len~0 .cse1)) (.cse0 (= main_~len~0 2)) (.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and .cse0 (<= .cse1 .cse2) (<= .cse2 main_~expected~0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ .cse2 2) .cse8) (<= main_~expected~0 .cse2)) (let ((.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (select (select |#memory_int| .cse11) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse9 (+ main_~i~0 main_~len~0))) (and (<= main_~len~0 .cse2) .cse3 .cse4 .cse5 (<= .cse9 .cse10) .cse7 .cse6 (<= (+ .cse10 1) .cse8) .cse0 (not (= .cse11 main_~s~0.base)) (<= .cse10 main_~expected~0) (<= main_~expected~0 .cse10) (<= (+ .cse2 1) .cse9) (= main_~s~0.offset 0))))))) [2021-02-21 20:42:57,529 INFO L185 CegarLoopUtils]: At program point L624-3(line 624) the Hoare annotation is: false [2021-02-21 20:42:57,529 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 613 632) the Hoare annotation is: true [2021-02-21 20:42:57,530 INFO L185 CegarLoopUtils]: At program point L620(line 620) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse2 (= main_~len~0 2)) (.cse3 (not (= .cse6 main_~s~0.base))) (.cse0 (* 2 main_~len~0)) (.cse5 (= main_~s~0.offset 0))) (or (let ((.cse4 (+ main_~i~0 2)) (.cse1 (+ (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)) 1))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse4 main_~len~0) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse0) (<= main_~len~0 .cse4) (<= .cse1 .cse0) .cse5)) (let ((.cse7 (+ main_~i~0 1)) (.cse8 (+ main_~new_data~0 1))) (and .cse2 .cse3 (<= .cse7 main_~len~0) (<= .cse8 .cse0) (<= main_~len~0 .cse7) (<= .cse0 .cse8) .cse5))))) [2021-02-21 20:42:57,530 INFO L185 CegarLoopUtils]: At program point L624-4(line 624) the Hoare annotation is: (let ((.cse8 (+ main_~i~0 2)) (.cse9 (* 2 main_~len~0)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= main_~len~0 2)) (.cse1 (<= main_~len~0 .cse5)) (.cse2 (<= main_~len~0 main_~new_data~0)) (.cse3 (< |main_#t~ret17| (+ main_~expected~0 1))) (.cse4 (<= (+ main_~new_data~0 2) .cse9)) (.cse6 (<= main_~len~0 .cse8)) (.cse7 (<= main_~expected~0 |main_#t~ret17|))) (or (and .cse0 .cse1 (<= (+ main_~i~0 1) main_~len~0) .cse2 .cse3 .cse4 (<= (+ .cse5 1) (+ main_~i~0 main_~len~0)) .cse6 .cse7) (and .cse0 .cse1 (<= .cse8 main_~len~0) .cse2 .cse3 .cse4 .cse6 .cse7 (<= (+ .cse5 2) .cse9))))) [2021-02-21 20:42:57,530 INFO L185 CegarLoopUtils]: At program point L620-1(lines 618 621) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse9 (select (select |#memory_int| .cse10) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse1 (+ .cse9 1)) (.cse0 (* 2 main_~len~0))) (let ((.cse2 (= main_~len~0 2)) (.cse3 (not (= .cse10 main_~s~0.base))) (.cse6 (<= .cse1 .cse0)) (.cse7 (= main_~s~0.offset 0))) (or (let ((.cse4 (+ main_~i~0 2)) (.cse5 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (and (<= .cse0 .cse1) .cse2 .cse3 (<= .cse4 .cse5) (<= main_~len~0 main_~new_data~0) (<= (+ main_~new_data~0 2) .cse0) (<= main_~len~0 .cse4) .cse6 (<= (+ .cse5 2) .cse0) .cse7)) (let ((.cse8 (+ main_~new_data~0 1))) (and .cse2 .cse3 (<= .cse8 .cse0) (<= main_~len~0 (+ main_~i~0 1)) (<= (+ main_~i~0 main_~len~0) .cse9) (<= .cse0 .cse8) .cse6 .cse7))))))) [2021-02-21 20:42:57,530 INFO L185 CegarLoopUtils]: At program point L616(line 616) the Hoare annotation is: (and (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,531 INFO L185 CegarLoopUtils]: At program point L616-1(line 616) the Hoare annotation is: (and (= |main_#t~ret14.offset| 0) (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) 4) |main_#t~ret14.base|))) [2021-02-21 20:42:57,531 INFO L185 CegarLoopUtils]: At program point L616-2(line 616) the Hoare annotation is: (and (= |main_#t~ret14.offset| 0) (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) 4) |main_#t~ret14.base|)) (= main_~s~0.offset 0)) [2021-02-21 20:42:57,531 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) the Hoare annotation is: false [2021-02-21 20:42:57,531 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,531 INFO L185 CegarLoopUtils]: At program point L625(lines 613 632) the Hoare annotation is: false [2021-02-21 20:42:57,531 INFO L185 CegarLoopUtils]: At program point L617(line 617) the Hoare annotation is: (and (= main_~len~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)) (= main_~s~0.offset 0)) [2021-02-21 20:42:57,532 INFO L192 CegarLoopUtils]: At program point L577(line 577) the Hoare annotation is: true [2021-02-21 20:42:57,532 INFO L185 CegarLoopUtils]: At program point L576(lines 576 578) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= |#memory_int| |old(#memory_int)|) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2021-02-21 20:42:57,532 INFO L185 CegarLoopUtils]: At program point L575(line 575) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,532 INFO L185 CegarLoopUtils]: At program point L576-1(lines 576 578) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= |#memory_int| |old(#memory_int)|) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2021-02-21 20:42:57,532 INFO L185 CegarLoopUtils]: At program point L575-1(line 575) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= |#memory_int| |old(#memory_int)|) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2021-02-21 20:42:57,532 INFO L185 CegarLoopUtils]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:42:57,532 INFO L185 CegarLoopUtils]: At program point node_createEXIT(lines 574 582) the Hoare annotation is: (and (= |node_create_#res.offset| 0) (= (select |#valid| |node_create_#res.base|) 1) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= (select |old(#valid)| |node_create_#res.base|) 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2021-02-21 20:42:57,533 INFO L185 CegarLoopUtils]: At program point node_createFINAL(lines 574 582) the Hoare annotation is: (and (= |node_create_#res.offset| 0) (= (select |#valid| |node_create_#res.base|) 1) (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= (select |old(#valid)| |node_create_#res.base|) 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2021-02-21 20:42:57,533 INFO L185 CegarLoopUtils]: At program point L580(line 580) the Hoare annotation is: (and (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2021-02-21 20:42:57,533 INFO L185 CegarLoopUtils]: At program point L579(line 579) the Hoare annotation is: (and (= (select |old(#valid)| |node_create_#t~malloc5.base|) 0) (= |node_create_#t~malloc5.offset| 0) (= 1 (select |#valid| |node_create_#t~malloc5.base|)) (= (select |#valid| node_create_~temp~0.base) 1) (= node_create_~temp~0.offset 0) (= 0 (select |old(#valid)| node_create_~temp~0.base))) [2021-02-21 20:42:57,545 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,546 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,551 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,552 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,554 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,554 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,555 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,555 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,555 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,556 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,556 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,556 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,556 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,557 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,557 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,558 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,558 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,559 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,559 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,559 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,560 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,560 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,560 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,560 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,561 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,561 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,563 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,563 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,563 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,564 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,564 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,565 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,565 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,566 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,568 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,569 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,569 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,569 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,569 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,569 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,570 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,570 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,570 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,570 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,571 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,572 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,573 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,573 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,573 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,573 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,574 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,574 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,574 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,574 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,574 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,575 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,577 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,580 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,580 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,580 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,583 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:563) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:248) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-02-21 20:42:57,585 INFO L168 Benchmark]: Toolchain (without parser) took 32845.27 ms. Allocated memory was 156.2 MB in the beginning and 412.1 MB in the end (delta: 255.9 MB). Free memory was 131.8 MB in the beginning and 250.3 MB in the end (delta: -118.5 MB). Peak memory consumption was 244.7 MB. Max. memory is 8.0 GB. [2021-02-21 20:42:57,585 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 156.2 MB. Free memory is still 129.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 20:42:57,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.82 ms. Allocated memory is still 156.2 MB. Free memory was 130.6 MB in the beginning and 107.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-02-21 20:42:57,586 INFO L168 Benchmark]: Boogie Preprocessor took 96.61 ms. Allocated memory is still 156.2 MB. Free memory was 107.7 MB in the beginning and 137.4 MB in the end (delta: -29.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. [2021-02-21 20:42:57,586 INFO L168 Benchmark]: RCFGBuilder took 717.66 ms. Allocated memory is still 156.2 MB. Free memory was 137.4 MB in the beginning and 87.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 50.3 MB. Max. memory is 8.0 GB. [2021-02-21 20:42:57,586 INFO L168 Benchmark]: TraceAbstraction took 31470.91 ms. Allocated memory was 156.2 MB in the beginning and 412.1 MB in the end (delta: 255.9 MB). Free memory was 87.1 MB in the beginning and 250.3 MB in the end (delta: -163.2 MB). Peak memory consumption was 199.1 MB. Max. memory is 8.0 GB. [2021-02-21 20:42:57,589 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 156.2 MB. Free memory is still 129.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 533.82 ms. Allocated memory is still 156.2 MB. Free memory was 130.6 MB in the beginning and 107.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 96.61 ms. Allocated memory is still 156.2 MB. Free memory was 107.7 MB in the beginning and 137.4 MB in the end (delta: -29.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. * RCFGBuilder took 717.66 ms. Allocated memory is still 156.2 MB. Free memory was 137.4 MB in the beginning and 87.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 50.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31470.91 ms. Allocated memory was 156.2 MB in the beginning and 412.1 MB in the end (delta: 255.9 MB). Free memory was 87.1 MB in the beginning and 250.3 MB in the end (delta: -163.2 MB). Peak memory consumption was 199.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: 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 - InvariantResult [Line: 600]: Loop Invariant [2021-02-21 20:42:57,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,597 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((index + 1 <= \old(index) && 2 <= \old(index)) || ((index + 1 <= \old(index) && (((head == #memory_$Pointer$[head][4] && head == #memory_$Pointer$[head][4]) || 1 <= head) || head + 1 <= 0)) && 1 <= \old(index))) || ((\old(index) == index && head == head) && head == head) - InvariantResult [Line: 618]: Loop Invariant [2021-02-21 20:42:57,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,599 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,600 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,600 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,600 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,603 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,604 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,605 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,606 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,610 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,610 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,610 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,611 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,611 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,611 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((len == 2 && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && len <= unknown-#memory_int-unknown[s][s]) && !(#memory_$Pointer$[s][4] == s)) && i + 2 <= len) && len <= new_data) && new_data + 2 <= 2 * len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == 0) || ((((len == 2 && !(#memory_$Pointer$[s][4] == s)) && i + 1 <= len) && len <= i + 1) && s == 0)) || ((((((((len == 2 && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && !(#memory_$Pointer$[s][4] == s)) && new_data + 1 <= 2 * len) && i + 2 <= len) && 2 * len <= new_data + 1) && len <= i + 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && s == 0) - InvariantResult [Line: 622]: Loop Invariant [2021-02-21 20:42:57,612 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,614 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,616 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,616 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,616 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,617 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,618 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((len == 2 && len <= unknown-#memory_int-unknown[s][s]) && !(#memory_$Pointer$[s][4] == s)) && len <= new_data) && new_data + 2 <= 2 * len) && i + len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && unknown-#memory_int-unknown[s][s] + 1 <= i + len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && s == 0) || (((((len == 2 && len <= unknown-#memory_int-unknown[s][s]) && len <= new_data) && new_data + 2 <= 2 * len) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && i + 3 <= len)) || (((((len == 2 && i + 2 <= unknown-#memory_int-unknown[s][s]) && len <= new_data) && new_data + 2 <= 2 * len) && 0 <= i) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) - InvariantResult [Line: 607]: Loop Invariant [2021-02-21 20:42:57,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,620 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,621 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,621 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,632 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,633 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,633 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,633 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,633 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((#memory_$Pointer$ == \old(#memory_$Pointer$) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 1 <= \old(index)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && (((#memory_$Pointer$[head][4] == head || head + 1 <= 0) || 1 <= head) || ((head == #memory_$Pointer$[head][4] && data == \old(data)) && #memory_$Pointer$[head][4] == head))) || ((((((#memory_$Pointer$ == \old(#memory_$Pointer$) && head == head) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && head == head) && \old(index) == index) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((#memory_$Pointer$ == \old(#memory_$Pointer$) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) - InvariantResult [Line: 585]: Loop Invariant [2021-02-21 20:42:57,634 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,635 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-21 20:42:57,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-21 20:42:57,638 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((1 == \valid[new_head] && \valid[head] == 1) && \old(len) <= len + 1) || (((((1 == \valid[new_head] && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(head == #memory_$Pointer$[head][4])) && new_head == 0) && \valid[head] == 1) && head == 0)) || (((((#memory_$Pointer$ == \old(#memory_$Pointer$) && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 592]: Procedure Contract for sll_destroy Derived contract for procedure sll_destroy: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int (Array Int Int)) (Array Int (Array Int Int)) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:563) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...