/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-36cd7be [2021-02-23 18:10:26,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 18:10:26,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 18:10:26,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 18:10:26,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 18:10:26,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 18:10:26,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 18:10:26,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 18:10:26,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 18:10:26,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 18:10:26,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 18:10:26,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 18:10:26,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 18:10:26,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 18:10:26,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 18:10:26,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 18:10:26,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 18:10:26,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 18:10:26,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 18:10:26,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 18:10:26,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 18:10:26,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 18:10:26,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 18:10:26,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 18:10:26,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 18:10:26,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 18:10:26,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 18:10:26,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 18:10:26,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 18:10:26,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 18:10:26,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 18:10:26,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 18:10:26,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 18:10:26,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 18:10:26,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 18:10:26,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 18:10:26,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 18:10:26,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 18:10:26,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 18:10:26,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 18:10:26,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 18:10:26,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-23 18:10:26,762 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 18:10:26,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 18:10:26,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 18:10:26,768 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 18:10:26,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 18:10:26,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 18:10:26,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 18:10:26,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 18:10:26,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 18:10:26,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 18:10:26,770 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 18:10:26,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 18:10:26,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 18:10:26,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 18:10:26,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 18:10:26,771 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-23 18:10:26,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-23 18:10:26,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 18:10:26,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 18:10:26,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 18:10:26,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-23 18:10:26,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 18:10:26,773 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-23 18:10:27,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 18:10:27,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 18:10:27,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 18:10:27,189 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 18:10:27,190 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 18:10:27,191 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-23 18:10:27,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5ff01f6/4ccf9df8a6ef48e0b4c79380cc6f3239/FLAG57e51c921 [2021-02-23 18:10:28,024 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 18:10:28,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2021-02-23 18:10:28,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5ff01f6/4ccf9df8a6ef48e0b4c79380cc6f3239/FLAG57e51c921 [2021-02-23 18:10:28,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5ff01f6/4ccf9df8a6ef48e0b4c79380cc6f3239 [2021-02-23 18:10:28,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 18:10:28,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 18:10:28,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 18:10:28,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 18:10:28,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 18:10:28,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:10:28" (1/1) ... [2021-02-23 18:10:28,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e11634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:28, skipping insertion in model container [2021-02-23 18:10:28,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 06:10:28" (1/1) ... [2021-02-23 18:10:28,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 18:10:28,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 18:10:28,998 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-23 18:10:29,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 18:10:29,021 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 18:10:29,102 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-23 18:10:29,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 18:10:29,187 INFO L208 MainTranslator]: Completed translation [2021-02-23 18:10:29,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29 WrapperNode [2021-02-23 18:10:29,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 18:10:29,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 18:10:29,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 18:10:29,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 18:10:29,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (1/1) ... [2021-02-23 18:10:29,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (1/1) ... [2021-02-23 18:10:29,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (1/1) ... [2021-02-23 18:10:29,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (1/1) ... [2021-02-23 18:10:29,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (1/1) ... [2021-02-23 18:10:29,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (1/1) ... [2021-02-23 18:10:29,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (1/1) ... [2021-02-23 18:10:29,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 18:10:29,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 18:10:29,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 18:10:29,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 18:10:29,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (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-23 18:10:29,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 18:10:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 18:10:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 18:10:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-02-23 18:10:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-02-23 18:10:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-02-23 18:10:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-02-23 18:10:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2021-02-23 18:10:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2021-02-23 18:10:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2021-02-23 18:10:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2021-02-23 18:10:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 18:10:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 18:10:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 18:10:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-02-23 18:10:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-02-23 18:10:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 18:10:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 18:10:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-02-23 18:10:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-02-23 18:10:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-02-23 18:10:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-02-23 18:10:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-02-23 18:10:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-02-23 18:10:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-02-23 18:10:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-02-23 18:10:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-02-23 18:10:29,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-02-23 18:10:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-02-23 18:10:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-02-23 18:10:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-02-23 18:10:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-02-23 18:10:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-02-23 18:10:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-02-23 18:10:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-02-23 18:10:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-02-23 18:10:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-02-23 18:10:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-02-23 18:10:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-02-23 18:10:29,449 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-02-23 18:10:29,450 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-02-23 18:10:29,450 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-02-23 18:10:29,450 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-02-23 18:10:29,450 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-02-23 18:10:29,450 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-02-23 18:10:29,450 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-02-23 18:10:29,450 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-02-23 18:10:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-02-23 18:10:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-02-23 18:10:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-02-23 18:10:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-02-23 18:10:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-02-23 18:10:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-02-23 18:10:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-02-23 18:10:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-02-23 18:10:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-02-23 18:10:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-02-23 18:10:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-02-23 18:10:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-02-23 18:10:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-02-23 18:10:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-02-23 18:10:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-02-23 18:10:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-02-23 18:10:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-02-23 18:10:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-02-23 18:10:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-02-23 18:10:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-02-23 18:10:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-02-23 18:10:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-02-23 18:10:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-02-23 18:10:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-02-23 18:10:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-23 18:10:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-02-23 18:10:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-23 18:10:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-02-23 18:10:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-02-23 18:10:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-02-23 18:10:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-02-23 18:10:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-02-23 18:10:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-02-23 18:10:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-02-23 18:10:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-02-23 18:10:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-02-23 18:10:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-02-23 18:10:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-02-23 18:10:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-02-23 18:10:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-02-23 18:10:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-02-23 18:10:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-02-23 18:10:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-02-23 18:10:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-02-23 18:10:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-02-23 18:10:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-02-23 18:10:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-02-23 18:10:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-02-23 18:10:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-02-23 18:10:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-02-23 18:10:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-02-23 18:10:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-02-23 18:10:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-02-23 18:10:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-02-23 18:10:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-02-23 18:10:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-02-23 18:10:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-02-23 18:10:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-02-23 18:10:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-02-23 18:10:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-02-23 18:10:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-02-23 18:10:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-02-23 18:10:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-02-23 18:10:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-02-23 18:10:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-02-23 18:10:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-02-23 18:10:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-02-23 18:10:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-02-23 18:10:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-02-23 18:10:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-02-23 18:10:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-02-23 18:10:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-02-23 18:10:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-02-23 18:10:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-02-23 18:10:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-02-23 18:10:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-02-23 18:10:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-02-23 18:10:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-23 18:10:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-02-23 18:10:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 18:10:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2021-02-23 18:10:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2021-02-23 18:10:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-02-23 18:10:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 18:10:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2021-02-23 18:10:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 18:10:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2021-02-23 18:10:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 18:10:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 18:10:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 18:10:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 18:10:29,868 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-02-23 18:10:30,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 18:10:30,099 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-02-23 18:10:30,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:10:30 BoogieIcfgContainer [2021-02-23 18:10:30,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 18:10:30,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 18:10:30,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 18:10:30,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 18:10:30,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 06:10:28" (1/3) ... [2021-02-23 18:10:30,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af364ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:10:30, skipping insertion in model container [2021-02-23 18:10:30,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 06:10:29" (2/3) ... [2021-02-23 18:10:30,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af364ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 06:10:30, skipping insertion in model container [2021-02-23 18:10:30,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 06:10:30" (3/3) ... [2021-02-23 18:10:30,112 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-02-23 18:10:30,120 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-23 18:10:30,125 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 18:10:30,146 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 18:10:30,171 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 18:10:30,171 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 18:10:30,171 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-23 18:10:30,172 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 18:10:30,172 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 18:10:30,172 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 18:10:30,172 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 18:10:30,172 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 18:10:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2021-02-23 18:10:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-02-23 18:10:30,202 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:30,203 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-23 18:10:30,203 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2073568287, now seen corresponding path program 1 times [2021-02-23 18:10:30,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:30,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658813323] [2021-02-23 18:10:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:30,326 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:30,485 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:30,487 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:30,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:30,489 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:30,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:30,571 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:30,572 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:30,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:30,630 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:30,631 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:30,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:30,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:30,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 18:10:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:30,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:30,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:30,658 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-23 18:10:30,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658813323] [2021-02-23 18:10:30,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:30,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-02-23 18:10:30,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579002158] [2021-02-23 18:10:30,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-02-23 18:10:30,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-02-23 18:10:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-02-23 18:10:30,694 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2021-02-23 18:10:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:31,181 INFO L93 Difference]: Finished difference Result 235 states and 290 transitions. [2021-02-23 18:10:31,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-02-23 18:10:31,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2021-02-23 18:10:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:31,197 INFO L225 Difference]: With dead ends: 235 [2021-02-23 18:10:31,197 INFO L226 Difference]: Without dead ends: 132 [2021-02-23 18:10:31,202 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-23 18:10:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-02-23 18:10:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2021-02-23 18:10:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-02-23 18:10:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-02-23 18:10:31,296 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 42 [2021-02-23 18:10:31,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:31,297 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-02-23 18:10:31,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-02-23 18:10:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-02-23 18:10:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-02-23 18:10:31,301 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:31,302 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-23 18:10:31,302 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 18:10:31,303 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1487845686, now seen corresponding path program 1 times [2021-02-23 18:10:31,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:31,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45802501] [2021-02-23 18:10:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:31,321 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:31,448 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:31,449 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:31,450 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:31,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:31,454 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:31,455 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:31,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:31,508 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:31,509 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:31,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:31,571 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:31,573 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:31,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:31,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:31,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 18:10:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:31,615 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:31,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:31,624 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-23 18:10:31,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [45802501] [2021-02-23 18:10:31,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:31,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-23 18:10:31,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828252977] [2021-02-23 18:10:31,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-23 18:10:31,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-23 18:10:31,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-02-23 18:10:31,630 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 7 states. [2021-02-23 18:10:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:32,025 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2021-02-23 18:10:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-02-23 18:10:32,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2021-02-23 18:10:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:32,028 INFO L225 Difference]: With dead ends: 149 [2021-02-23 18:10:32,028 INFO L226 Difference]: Without dead ends: 96 [2021-02-23 18:10:32,030 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-23 18:10:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-02-23 18:10:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2021-02-23 18:10:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-02-23 18:10:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2021-02-23 18:10:32,048 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 42 [2021-02-23 18:10:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:32,048 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2021-02-23 18:10:32,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-23 18:10:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2021-02-23 18:10:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-02-23 18:10:32,051 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:32,051 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-23 18:10:32,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 18:10:32,052 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:32,052 INFO L82 PathProgramCache]: Analyzing trace with hash -762840836, now seen corresponding path program 1 times [2021-02-23 18:10:32,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:32,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268733197] [2021-02-23 18:10:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:32,121 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:32,126 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:32,172 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,173 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:32,173 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,174 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:32,178 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,178 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:32,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:32,223 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:32,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:32,333 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:32,346 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,347 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:32,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,362 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:32,375 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,376 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:32,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:32,413 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:32,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-23 18:10:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:32,420 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:32,421 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:32,427 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-23 18:10:32,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268733197] [2021-02-23 18:10:32,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:32,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-23 18:10:32,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667585634] [2021-02-23 18:10:32,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-23 18:10:32,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-23 18:10:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-02-23 18:10:32,432 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 9 states. [2021-02-23 18:10:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:32,904 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2021-02-23 18:10:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-02-23 18:10:32,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2021-02-23 18:10:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:32,907 INFO L225 Difference]: With dead ends: 158 [2021-02-23 18:10:32,907 INFO L226 Difference]: Without dead ends: 105 [2021-02-23 18:10:32,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-02-23 18:10:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-02-23 18:10:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2021-02-23 18:10:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-02-23 18:10:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-02-23 18:10:32,926 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 60 [2021-02-23 18:10:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:32,926 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-02-23 18:10:32,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-23 18:10:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-02-23 18:10:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-23 18:10:32,930 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:32,930 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-23 18:10:32,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 18:10:32,931 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:32,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2138915502, now seen corresponding path program 2 times [2021-02-23 18:10:32,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:32,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935834835] [2021-02-23 18:10:32,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:32,962 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:32,967 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,039 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,041 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,041 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:33,053 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:33,057 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:33,066 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 18:10:33,067 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 18:10:33,068 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,068 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,152 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,153 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,169 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-02-23 18:10:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,177 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,185 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-23 18:10:33,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935834835] [2021-02-23 18:10:33,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:33,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-02-23 18:10:33,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91947369] [2021-02-23 18:10:33,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-02-23 18:10:33,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-02-23 18:10:33,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-02-23 18:10:33,189 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 6 states. [2021-02-23 18:10:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:33,503 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2021-02-23 18:10:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-02-23 18:10:33,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-02-23 18:10:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:33,514 INFO L225 Difference]: With dead ends: 141 [2021-02-23 18:10:33,514 INFO L226 Difference]: Without dead ends: 114 [2021-02-23 18:10:33,516 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-23 18:10:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-02-23 18:10:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2021-02-23 18:10:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-02-23 18:10:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2021-02-23 18:10:33,554 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 78 [2021-02-23 18:10:33,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:33,555 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2021-02-23 18:10:33,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-02-23 18:10:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2021-02-23 18:10:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-02-23 18:10:33,558 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:33,559 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-23 18:10:33,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 18:10:33,559 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash 95378343, now seen corresponding path program 1 times [2021-02-23 18:10:33,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:33,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1180402199] [2021-02-23 18:10:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:33,593 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:33,597 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,682 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,683 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,684 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,684 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:33,688 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:33,689 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:33,698 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 18:10:33,698 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 18:10:33,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,699 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,778 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,785 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,785 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,832 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,833 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:33,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,842 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:33,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-02-23 18:10:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:33,855 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:33,856 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:33,873 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-23 18:10:33,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1180402199] [2021-02-23 18:10:33,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:33,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-23 18:10:33,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865880727] [2021-02-23 18:10:33,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-23 18:10:33,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-23 18:10:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-02-23 18:10:33,885 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 9 states. [2021-02-23 18:10:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:34,423 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2021-02-23 18:10:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-23 18:10:34,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2021-02-23 18:10:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:34,429 INFO L225 Difference]: With dead ends: 169 [2021-02-23 18:10:34,430 INFO L226 Difference]: Without dead ends: 123 [2021-02-23 18:10:34,431 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-23 18:10:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-02-23 18:10:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2021-02-23 18:10:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-02-23 18:10:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2021-02-23 18:10:34,459 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 91 [2021-02-23 18:10:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:34,461 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2021-02-23 18:10:34,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-23 18:10:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-02-23 18:10:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-02-23 18:10:34,468 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:34,469 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-23 18:10:34,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 18:10:34,469 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:34,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 261527972, now seen corresponding path program 1 times [2021-02-23 18:10:34,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:34,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590989957] [2021-02-23 18:10:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:34,526 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:34,531 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:34,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,611 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,612 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,612 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:34,618 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:34,618 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:34,627 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:34,627 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:34,639 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:34,639 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:34,650 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 18:10:34,651 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 18:10:34,651 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,652 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:34,678 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:34,712 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:34,719 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:34,725 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,725 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:34,750 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,751 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-02-23 18:10:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:34,755 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:34,756 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:34,770 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-23 18:10:34,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590989957] [2021-02-23 18:10:34,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:34,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-23 18:10:34,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759151332] [2021-02-23 18:10:34,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-23 18:10:34,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-23 18:10:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-02-23 18:10:34,773 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2021-02-23 18:10:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:35,117 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2021-02-23 18:10:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-23 18:10:35,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2021-02-23 18:10:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:35,119 INFO L225 Difference]: With dead ends: 147 [2021-02-23 18:10:35,119 INFO L226 Difference]: Without dead ends: 120 [2021-02-23 18:10:35,120 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-23 18:10:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-02-23 18:10:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2021-02-23 18:10:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-02-23 18:10:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2021-02-23 18:10:35,134 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 98 [2021-02-23 18:10:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:35,135 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2021-02-23 18:10:35,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-23 18:10:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2021-02-23 18:10:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-02-23 18:10:35,136 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:35,136 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-23 18:10:35,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 18:10:35,137 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1290697615, now seen corresponding path program 2 times [2021-02-23 18:10:35,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:35,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903861103] [2021-02-23 18:10:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:35,166 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:35,168 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,214 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,214 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,215 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:35,218 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:35,219 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:35,242 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,243 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:35,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,253 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,277 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,278 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,317 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,317 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,337 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,339 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,348 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,349 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,376 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,377 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 18:10:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 18:10:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:35,396 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,397 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:35,398 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,398 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:35,406 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:35,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:35,435 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-23 18:10:35,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903861103] [2021-02-23 18:10:35,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:35,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 18:10:35,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990291217] [2021-02-23 18:10:35,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 18:10:35,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 18:10:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-02-23 18:10:35,441 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 10 states. [2021-02-23 18:10:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:35,937 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2021-02-23 18:10:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-23 18:10:35,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 111 [2021-02-23 18:10:35,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:35,939 INFO L225 Difference]: With dead ends: 157 [2021-02-23 18:10:35,939 INFO L226 Difference]: Without dead ends: 131 [2021-02-23 18:10:35,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-02-23 18:10:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-02-23 18:10:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-02-23 18:10:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-23 18:10:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2021-02-23 18:10:35,956 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 111 [2021-02-23 18:10:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:35,957 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2021-02-23 18:10:35,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 18:10:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2021-02-23 18:10:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-02-23 18:10:35,958 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:35,959 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-23 18:10:35,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 18:10:35,959 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:35,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1932003720, now seen corresponding path program 1 times [2021-02-23 18:10:35,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:35,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088017036] [2021-02-23 18:10:35,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:35,997 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:36,000 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:36,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,178 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:36,180 WARN L141 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-02-23 18:10:36,180 WARN L147 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size 12 [2021-02-23 18:10:36,188 WARN L141 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-02-23 18:10:36,189 WARN L147 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size 12 [2021-02-23 18:10:36,203 WARN L141 QuantifierPusher]: treesize reduction 4, result has 84.6 percent of original size [2021-02-23 18:10:36,205 WARN L147 QuantifierPusher]: treesize reduction 4, result has 84.6 percent of original size 22 [2021-02-23 18:10:36,226 WARN L141 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size [2021-02-23 18:10:36,227 WARN L147 QuantifierPusher]: treesize reduction 4, result has 86.7 percent of original size 26 [2021-02-23 18:10:36,243 WARN L141 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-02-23 18:10:36,247 WARN L147 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-02-23 18:10:36,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,275 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-02-23 18:10:36,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-02-23 18:10:36,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-02-23 18:10:36,350 WARN L141 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-02-23 18:10:36,350 WARN L147 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size 9 [2021-02-23 18:10:36,370 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:36,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:36,409 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,410 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:36,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:36,501 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:36,507 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:36,524 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,525 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:36,544 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,545 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:36,562 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,563 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-02-23 18:10:36,586 WARN L141 QuantifierPusher]: treesize reduction 5, result has 61.5 percent of original size [2021-02-23 18:10:36,587 WARN L147 QuantifierPusher]: treesize reduction 5, result has 61.5 percent of original size 8 [2021-02-23 18:10:36,612 WARN L141 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size [2021-02-23 18:10:36,613 WARN L147 QuantifierPusher]: treesize reduction 5, result has 73.7 percent of original size 14 [2021-02-23 18:10:36,639 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,640 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-02-23 18:10:36,668 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-02-23 18:10:36,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:36,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,705 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:36,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,707 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:36,731 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,733 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:36,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:36,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:36,799 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,800 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:36,826 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,827 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 18:10:36,858 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 18:10:36,898 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:36,899 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 18:10:37,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:37,041 WARN L141 QuantifierPusher]: treesize reduction 12, result has 57.1 percent of original size [2021-02-23 18:10:37,042 WARN L147 QuantifierPusher]: treesize reduction 12, result has 57.1 percent of original size 16 [2021-02-23 18:10:37,085 WARN L141 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-02-23 18:10:37,086 WARN L147 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size 19 [2021-02-23 18:10:37,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,135 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-02-23 18:10:37,192 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-02-23 18:10:37,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,360 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-02-23 18:10:37,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 18:10:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:37,455 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,456 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-02-23 18:10:37,518 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,519 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-02-23 18:10:37,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 18:10:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:37,648 WARN L141 QuantifierPusher]: treesize reduction 12, result has 50.0 percent of original size [2021-02-23 18:10:37,648 WARN L147 QuantifierPusher]: treesize reduction 12, result has 50.0 percent of original size 12 [2021-02-23 18:10:37,696 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,697 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 18:10:37,763 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,764 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 18:10:37,848 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,849 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 18:10:37,919 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:37,919 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-02-23 18:10:38,060 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-23 18:10:38,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088017036] [2021-02-23 18:10:38,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:38,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-02-23 18:10:38,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607724855] [2021-02-23 18:10:38,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-02-23 18:10:38,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:38,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-02-23 18:10:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1550, Unknown=0, NotChecked=0, Total=1640 [2021-02-23 18:10:38,063 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 41 states. [2021-02-23 18:10:40,676 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2021-02-23 18:10:40,917 WARN L202 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-02-23 18:10:41,094 WARN L202 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-02-23 18:10:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:44,408 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2021-02-23 18:10:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-02-23 18:10:44,409 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2021-02-23 18:10:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:44,411 INFO L225 Difference]: With dead ends: 218 [2021-02-23 18:10:44,412 INFO L226 Difference]: Without dead ends: 215 [2021-02-23 18:10:44,415 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-23 18:10:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-02-23 18:10:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 156. [2021-02-23 18:10:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-02-23 18:10:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2021-02-23 18:10:44,453 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 118 [2021-02-23 18:10:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:44,453 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2021-02-23 18:10:44,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2021-02-23 18:10:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2021-02-23 18:10:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-23 18:10:44,455 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:44,455 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-23 18:10:44,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 18:10:44,456 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash -539169647, now seen corresponding path program 2 times [2021-02-23 18:10:44,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:44,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292811676] [2021-02-23 18:10:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:44,486 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:44,490 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,555 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,556 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,557 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,557 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:44,563 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:44,567 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:44,574 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,575 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:44,580 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,580 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,604 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,604 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,637 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,638 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,648 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,671 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 18:10:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,677 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 18:10:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:44,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,693 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:44,693 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:44,702 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,703 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:44,713 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,714 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:44,726 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:44,729 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:44,786 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-23 18:10:44,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292811676] [2021-02-23 18:10:44,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:44,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-23 18:10:44,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366509439] [2021-02-23 18:10:44,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-23 18:10:44,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:44,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-23 18:10:44,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-02-23 18:10:44,789 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 12 states. [2021-02-23 18:10:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:45,612 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2021-02-23 18:10:45,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-23 18:10:45,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2021-02-23 18:10:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:45,615 INFO L225 Difference]: With dead ends: 208 [2021-02-23 18:10:45,615 INFO L226 Difference]: Without dead ends: 164 [2021-02-23 18:10:45,616 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-23 18:10:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-02-23 18:10:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-02-23 18:10:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-02-23 18:10:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2021-02-23 18:10:45,645 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 125 [2021-02-23 18:10:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:45,645 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2021-02-23 18:10:45,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-23 18:10:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2021-02-23 18:10:45,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-23 18:10:45,647 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:45,648 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-23 18:10:45,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-23 18:10:45,648 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -617921473, now seen corresponding path program 3 times [2021-02-23 18:10:45,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:45,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1428436690] [2021-02-23 18:10:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:45,676 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:45,679 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,722 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,723 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,723 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:45,727 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:45,728 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:45,735 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:45,736 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:45,745 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:45,746 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:45,756 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 18:10:45,757 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 18:10:45,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,784 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,784 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,829 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,829 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,835 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,835 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,863 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 18:10:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,874 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,875 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,875 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:45,885 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,885 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 18:10:45,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,900 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:45,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-02-23 18:10:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:45,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:45,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:45,935 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-23 18:10:45,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1428436690] [2021-02-23 18:10:45,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:45,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-23 18:10:45,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648280556] [2021-02-23 18:10:45,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-23 18:10:45,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:45,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-23 18:10:45,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-02-23 18:10:45,937 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand 12 states. [2021-02-23 18:10:46,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:46,639 INFO L93 Difference]: Finished difference Result 235 states and 260 transitions. [2021-02-23 18:10:46,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-23 18:10:46,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2021-02-23 18:10:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:46,641 INFO L225 Difference]: With dead ends: 235 [2021-02-23 18:10:46,641 INFO L226 Difference]: Without dead ends: 159 [2021-02-23 18:10:46,643 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-23 18:10:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-02-23 18:10:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2021-02-23 18:10:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-02-23 18:10:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2021-02-23 18:10:46,676 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 125 [2021-02-23 18:10:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:46,677 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2021-02-23 18:10:46,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-23 18:10:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2021-02-23 18:10:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-02-23 18:10:46,679 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:46,680 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-23 18:10:46,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-23 18:10:46,680 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1043789163, now seen corresponding path program 4 times [2021-02-23 18:10:46,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:46,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1876563854] [2021-02-23 18:10:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:46,715 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:46,719 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,768 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,769 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:46,774 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:46,775 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:46,782 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 18:10:46,783 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 18:10:46,784 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,784 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,809 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,810 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,845 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,846 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,852 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:46,916 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:46,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:46,937 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,938 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:46,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-02-23 18:10:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,958 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,959 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-02-23 18:10:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:46,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:46,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:46,980 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-23 18:10:46,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1876563854] [2021-02-23 18:10:46,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:46,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-23 18:10:46,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566458024] [2021-02-23 18:10:46,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 18:10:46,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:46,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 18:10:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-02-23 18:10:46,982 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 11 states. [2021-02-23 18:10:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:47,816 INFO L93 Difference]: Finished difference Result 220 states and 236 transitions. [2021-02-23 18:10:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-02-23 18:10:47,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2021-02-23 18:10:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:47,818 INFO L225 Difference]: With dead ends: 220 [2021-02-23 18:10:47,819 INFO L226 Difference]: Without dead ends: 130 [2021-02-23 18:10:47,820 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-23 18:10:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-02-23 18:10:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2021-02-23 18:10:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-02-23 18:10:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2021-02-23 18:10:47,843 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 125 [2021-02-23 18:10:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:47,843 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2021-02-23 18:10:47,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 18:10:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2021-02-23 18:10:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-02-23 18:10:47,845 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:47,845 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-23 18:10:47,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-23 18:10:47,846 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash 480324644, now seen corresponding path program 1 times [2021-02-23 18:10:47,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:47,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [277681980] [2021-02-23 18:10:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:47,876 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:47,879 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:47,953 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:47,954 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:47,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:47,955 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:47,959 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:47,960 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:47,968 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:47,968 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:47,977 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:47,979 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:47,989 WARN L141 QuantifierPusher]: treesize reduction 2, result has 85.7 percent of original size [2021-02-23 18:10:47,991 WARN L147 QuantifierPusher]: treesize reduction 2, result has 85.7 percent of original size 12 [2021-02-23 18:10:48,005 WARN L141 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size [2021-02-23 18:10:48,006 WARN L147 QuantifierPusher]: treesize reduction 2, result has 87.5 percent of original size 14 [2021-02-23 18:10:48,021 WARN L141 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-02-23 18:10:48,022 WARN L147 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size 22 [2021-02-23 18:10:48,042 WARN L141 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-02-23 18:10:48,043 WARN L147 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size 24 [2021-02-23 18:10:48,064 WARN L141 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-02-23 18:10:48,065 WARN L147 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size 24 [2021-02-23 18:10:48,087 WARN L141 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-02-23 18:10:48,088 WARN L147 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size 22 [2021-02-23 18:10:48,112 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,113 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 18:10:48,133 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-23 18:10:48,134 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-23 18:10:48,161 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,162 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:48,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,216 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,217 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:48,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,276 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,277 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:48,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:48,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,294 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,295 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:48,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,336 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:48,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 18:10:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,350 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,351 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 18:10:48,384 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,385 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-02-23 18:10:48,414 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,415 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 18:10:48,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 18:10:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,440 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,441 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:48,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-23 18:10:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:48,451 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,452 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 18:10:48,488 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,490 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 18:10:48,523 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:48,524 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 18:10:48,615 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-23 18:10:48,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [277681980] [2021-02-23 18:10:48,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:48,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-02-23 18:10:48,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198547808] [2021-02-23 18:10:48,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-02-23 18:10:48,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-02-23 18:10:48,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-02-23 18:10:48,618 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 23 states. [2021-02-23 18:10:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:51,040 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2021-02-23 18:10:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-23 18:10:51,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 135 [2021-02-23 18:10:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:51,043 INFO L225 Difference]: With dead ends: 170 [2021-02-23 18:10:51,043 INFO L226 Difference]: Without dead ends: 159 [2021-02-23 18:10:51,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2021-02-23 18:10:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-02-23 18:10:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2021-02-23 18:10:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-02-23 18:10:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2021-02-23 18:10:51,074 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 135 [2021-02-23 18:10:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:51,074 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2021-02-23 18:10:51,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-02-23 18:10:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2021-02-23 18:10:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-02-23 18:10:51,077 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:51,077 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-23 18:10:51,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-02-23 18:10:51,077 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2123308427, now seen corresponding path program 2 times [2021-02-23 18:10:51,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:51,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1241818816] [2021-02-23 18:10:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:51,126 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:51,129 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,202 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,208 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:51,211 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:51,214 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:51,223 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:51,223 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:51,233 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:51,233 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:51,243 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,244 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:51,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,250 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,314 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,321 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,322 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,328 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,329 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,352 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,356 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 18:10:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,363 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,364 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 18:10:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,371 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,372 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-23 18:10:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:51,381 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:51,382 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:51,393 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,394 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 18:10:51,408 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:51,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-23 18:10:51,449 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-23 18:10:51,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1241818816] [2021-02-23 18:10:51,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:51,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-02-23 18:10:51,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647696287] [2021-02-23 18:10:51,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-02-23 18:10:51,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:51,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-02-23 18:10:51,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-02-23 18:10:51,453 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 13 states. [2021-02-23 18:10:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:52,101 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2021-02-23 18:10:52,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-23 18:10:52,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 142 [2021-02-23 18:10:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:52,103 INFO L225 Difference]: With dead ends: 191 [2021-02-23 18:10:52,104 INFO L226 Difference]: Without dead ends: 135 [2021-02-23 18:10:52,104 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-23 18:10:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-02-23 18:10:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-02-23 18:10:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-02-23 18:10:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2021-02-23 18:10:52,142 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 142 [2021-02-23 18:10:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:52,143 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2021-02-23 18:10:52,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-02-23 18:10:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2021-02-23 18:10:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-02-23 18:10:52,145 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 18:10:52,146 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-23 18:10:52,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-02-23 18:10:52,146 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 18:10:52,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 18:10:52,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1657400056, now seen corresponding path program 3 times [2021-02-23 18:10:52,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 18:10:52,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523738202] [2021-02-23 18:10:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 18:10:52,178 INFO L84 AcceleratorFastUPR]: FastUPR could not accelerate loop because java.lang.UnsupportedOperationException: No Result found. [2021-02-23 18:10:52,183 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 18:10:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,247 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,248 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,249 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-23 18:10:52,254 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:52,254 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:52,264 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:52,265 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:52,274 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:52,275 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:52,290 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:52,290 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:52,304 WARN L141 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size [2021-02-23 18:10:52,305 WARN L147 QuantifierPusher]: treesize reduction 2, result has 81.8 percent of original size 9 [2021-02-23 18:10:52,321 WARN L141 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size [2021-02-23 18:10:52,321 WARN L147 QuantifierPusher]: treesize reduction 8, result has 11.1 percent of original size 1 [2021-02-23 18:10:52,322 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,322 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 18:10:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,357 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,358 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-23 18:10:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,424 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,425 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-23 18:10:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-02-23 18:10:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,435 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,435 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-02-23 18:10:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,458 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-02-23 18:10:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,464 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,464 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-02-23 18:10:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,470 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,470 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-02-23 18:10:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,476 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,477 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-02-23 18:10:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 18:10:52,480 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 18:10:52,481 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 18:10:52,515 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-23 18:10:52,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523738202] [2021-02-23 18:10:52,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 18:10:52,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-23 18:10:52,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401614427] [2021-02-23 18:10:52,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 18:10:52,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 18:10:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 18:10:52,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-02-23 18:10:52,518 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 11 states. [2021-02-23 18:10:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 18:10:52,970 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2021-02-23 18:10:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-23 18:10:52,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2021-02-23 18:10:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 18:10:52,972 INFO L225 Difference]: With dead ends: 160 [2021-02-23 18:10:52,972 INFO L226 Difference]: Without dead ends: 0 [2021-02-23 18:10:52,973 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-23 18:10:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-23 18:10:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-23 18:10:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-23 18:10:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-23 18:10:52,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2021-02-23 18:10:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 18:10:52,974 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-23 18:10:52,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 18:10:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-23 18:10:52,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-23 18:10:52,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-02-23 18:10:52,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-23 18:10:54,899 WARN L202 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2021-02-23 18:10:55,160 WARN L202 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2021-02-23 18:10:55,429 WARN L202 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-23 18:10:55,705 WARN L202 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2021-02-23 18:10:55,846 WARN L202 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2021-02-23 18:10:56,152 WARN L202 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-23 18:10:56,463 WARN L202 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-02-23 18:10:56,734 WARN L202 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-23 18:10:57,103 WARN L202 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-02-23 18:10:57,256 WARN L202 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-02-23 18:10:57,591 WARN L202 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-02-23 18:10:57,729 WARN L202 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2021-02-23 18:10:58,005 WARN L202 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2021-02-23 18:10:58,198 WARN L202 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-02-23 18:10:58,393 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-02-23 18:10:58,537 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2021-02-23 18:10:58,774 WARN L202 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2021-02-23 18:10:58,971 WARN L202 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2021-02-23 18:10:59,205 WARN L202 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2021-02-23 18:10:59,761 WARN L202 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2021-02-23 18:10:59,890 WARN L202 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2021-02-23 18:11:00,148 WARN L202 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-02-23 18:11:00,314 WARN L202 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2021-02-23 18:11:00,467 WARN L202 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2021-02-23 18:11:00,818 WARN L202 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2021-02-23 18:11:01,102 WARN L202 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-02-23 18:11:01,648 WARN L202 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2021-02-23 18:11:01,654 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-02-23 18:11:01,654 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-02-23 18:11:01,655 INFO L189 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-02-23 18:11:01,655 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-02-23 18:11:01,655 INFO L189 CegarLoopUtils]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-02-23 18:11:01,655 INFO L185 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-02-23 18:11:01,655 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-23 18:11:01,656 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2021-02-23 18:11:01,656 INFO L192 CegarLoopUtils]: At program point L12(line 12) the Hoare annotation is: true [2021-02-23 18:11:01,656 INFO L192 CegarLoopUtils]: At program point L12-1(line 12) the Hoare annotation is: true [2021-02-23 18:11:01,656 INFO L192 CegarLoopUtils]: At program point L12-2(line 12) the Hoare annotation is: true [2021-02-23 18:11:01,656 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-23 18:11:01,656 INFO L192 CegarLoopUtils]: At program point L12-3(line 12) the Hoare annotation is: true [2021-02-23 18:11:01,656 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point myexitENTRY(lines 571 573) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L572(line 572) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L189 CegarLoopUtils]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L595(line 595) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L594(line 594) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L595-1(line 595) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L594-1(line 594) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L594-2(line 594) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point L593-3(lines 592 598) the Hoare annotation is: true [2021-02-23 18:11:01,657 INFO L192 CegarLoopUtils]: At program point sll_destroyEXIT(lines 592 598) the Hoare annotation is: true [2021-02-23 18:11:01,658 INFO L185 CegarLoopUtils]: At program point sll_destroyENTRY(lines 592 598) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-02-23 18:11:01,658 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-23 18:11:01,658 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-23 18:11:01,658 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-23 18:11:01,658 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-23 18:11:01,659 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-23 18:11:01,659 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-23 18:11:01,659 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-23 18:11:01,659 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-23 18:11:01,659 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-23 18:11:01,660 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-23 18:11:01,660 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-23 18:11:01,660 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-23 18:11:01,660 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-23 18:11:01,661 INFO L189 CegarLoopUtils]: For program point __bswap_32ENTRY(lines 74 78) no Hoare annotation was computed. [2021-02-23 18:11:01,661 INFO L189 CegarLoopUtils]: For program point L77(line 77) no Hoare annotation was computed. [2021-02-23 18:11:01,661 INFO L189 CegarLoopUtils]: For program point L77-1(line 77) no Hoare annotation was computed. [2021-02-23 18:11:01,661 INFO L189 CegarLoopUtils]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2021-02-23 18:11:01,661 INFO L189 CegarLoopUtils]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2021-02-23 18:11:01,661 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-23 18:11:01,661 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-23 18:11:01,661 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-23 18:11:01,661 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-23 18:11:01,662 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-23 18:11:01,662 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-23 18:11:01,662 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-23 18:11:01,662 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-23 18:11:01,662 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-23 18:11:01,663 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-23 18:11:01,663 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-23 18:11:01,663 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-23 18:11:01,663 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-23 18:11:01,663 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-23 18:11:01,664 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-23 18:11:01,664 INFO L189 CegarLoopUtils]: For program point __bswap_64ENTRY(lines 79 83) no Hoare annotation was computed. [2021-02-23 18:11:01,664 INFO L189 CegarLoopUtils]: For program point L82-1(line 82) no Hoare annotation was computed. [2021-02-23 18:11:01,664 INFO L189 CegarLoopUtils]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2021-02-23 18:11:01,664 INFO L189 CegarLoopUtils]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2021-02-23 18:11:01,664 INFO L189 CegarLoopUtils]: For program point L82(line 82) no Hoare annotation was computed. [2021-02-23 18:11:01,664 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-23 18:11:01,664 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 18:11:01,665 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-23 18:11:01,665 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-23 18:11:01,665 INFO L192 CegarLoopUtils]: At program point sll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2021-02-23 18:11:01,665 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-23 18:11:01,665 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-23 18:11:01,666 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-23 18:11:01,666 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-23 18:11:01,666 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-23 18:11:01,666 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-23 18:11:01,666 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-23 18:11:01,667 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-23 18:11:01,667 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-23 18:11:01,667 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-23 18:11:01,667 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-23 18:11:01,668 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-23 18:11:01,668 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-23 18:11:01,668 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 613 632) the Hoare annotation is: true [2021-02-23 18:11:01,668 INFO L185 CegarLoopUtils]: At program point L630(line 630) the Hoare annotation is: false [2021-02-23 18:11:01,668 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-23 18:11:01,669 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-23 18:11:01,669 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-23 18:11:01,669 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-23 18:11:01,669 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-23 18:11:01,669 INFO L192 CegarLoopUtils]: At program point L622-6(lines 622 627) the Hoare annotation is: true [2021-02-23 18:11:01,670 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-23 18:11:01,670 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-23 18:11:01,670 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-23 18:11:01,670 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-23 18:11:01,671 INFO L185 CegarLoopUtils]: At program point L631(line 631) the Hoare annotation is: false [2021-02-23 18:11:01,671 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-23 18:11:01,671 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-23 18:11:01,671 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-23 18:11:01,671 INFO L192 CegarLoopUtils]: At program point L628(line 628) the Hoare annotation is: true [2021-02-23 18:11:01,672 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-23 18:11:01,672 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-23 18:11:01,672 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-23 18:11:01,672 INFO L185 CegarLoopUtils]: At program point L624-3(line 624) the Hoare annotation is: false [2021-02-23 18:11:01,673 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 613 632) the Hoare annotation is: true [2021-02-23 18:11:01,673 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-23 18:11:01,673 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-23 18:11:01,673 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-23 18:11:01,673 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-23 18:11:01,674 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-23 18:11:01,674 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-23 18:11:01,674 INFO L185 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) the Hoare annotation is: false [2021-02-23 18:11:01,674 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-23 18:11:01,674 INFO L185 CegarLoopUtils]: At program point L625(lines 613 632) the Hoare annotation is: false [2021-02-23 18:11:01,675 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-23 18:11:01,675 INFO L192 CegarLoopUtils]: At program point L577(line 577) the Hoare annotation is: true [2021-02-23 18:11:01,675 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-23 18:11:01,675 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-23 18:11:01,675 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-23 18:11:01,675 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-23 18:11:01,676 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-23 18:11:01,676 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-23 18:11:01,676 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-23 18:11:01,676 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-23 18:11:01,676 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-23 18:11:01,688 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,689 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,695 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,695 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,701 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,702 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,706 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,716 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,717 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,736 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,737 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,747 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,756 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-23 18:11:01,760 INFO L168 Benchmark]: Toolchain (without parser) took 33406.32 ms. Allocated memory was 151.0 MB in the beginning and 380.6 MB in the end (delta: 229.6 MB). Free memory was 126.2 MB in the beginning and 161.4 MB in the end (delta: -35.3 MB). Peak memory consumption was 225.7 MB. Max. memory is 8.0 GB. [2021-02-23 18:11:01,760 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 151.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 18:11:01,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.35 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 102.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-02-23 18:11:01,761 INFO L168 Benchmark]: Boogie Preprocessor took 151.27 ms. Allocated memory is still 151.0 MB. Free memory was 102.3 MB in the beginning and 132.2 MB in the end (delta: -29.9 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. [2021-02-23 18:11:01,764 INFO L168 Benchmark]: RCFGBuilder took 760.11 ms. Allocated memory is still 151.0 MB. Free memory was 132.2 MB in the beginning and 82.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 50.3 MB. Max. memory is 8.0 GB. [2021-02-23 18:11:01,764 INFO L168 Benchmark]: TraceAbstraction took 31655.64 ms. Allocated memory was 151.0 MB in the beginning and 380.6 MB in the end (delta: 229.6 MB). Free memory was 81.9 MB in the beginning and 161.4 MB in the end (delta: -79.5 MB). Peak memory consumption was 182.2 MB. Max. memory is 8.0 GB. [2021-02-23 18:11:01,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 151.0 MB. Free memory is still 125.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 813.35 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 102.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 151.27 ms. Allocated memory is still 151.0 MB. Free memory was 102.3 MB in the beginning and 132.2 MB in the end (delta: -29.9 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 760.11 ms. Allocated memory is still 151.0 MB. Free memory was 132.2 MB in the beginning and 82.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 50.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31655.64 ms. Allocated memory was 151.0 MB in the beginning and 380.6 MB in the end (delta: 229.6 MB). Free memory was 81.9 MB in the beginning and 161.4 MB in the end (delta: -79.5 MB). Peak memory consumption was 182.2 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-23 18:11:01,772 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,773 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,773 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,774 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-23 18:11:01,774 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,774 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,775 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,777 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,777 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,777 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,778 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,778 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,778 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,779 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,779 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,781 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,782 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,782 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,782 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,782 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,783 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,783 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,784 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,784 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,784 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,785 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-23 18:11:01,786 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,787 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,787 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,787 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,787 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,789 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,795 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,795 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,797 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-23 18:11:01,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,799 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,800 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,800 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,814 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,814 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,814 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,814 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,814 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-23 18:11:01,815 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,815 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,815 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,815 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,816 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,816 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,816 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,816 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,816 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,817 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-02-23 18:11:01,817 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-02-23 18:11:01,817 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...