java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:13:31,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:13:31,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:13:31,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:13:31,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:13:31,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:13:31,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:13:31,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:13:31,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:13:31,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:13:31,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:13:31,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:13:31,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:13:31,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:13:31,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:13:31,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:13:31,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:13:31,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:13:31,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:13:31,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:13:31,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:13:31,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:13:31,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:13:31,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:13:31,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:13:31,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:13:31,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:13:31,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:13:31,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:13:31,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:13:31,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:13:31,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:13:31,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:13:31,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:13:31,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:13:31,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:13:31,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:13:31,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:13:31,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:13:31,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:13:31,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:13:31,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:13:31,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:13:31,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:13:31,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:13:31,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:13:31,803 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:13:31,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:13:31,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:13:31,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:13:31,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:13:31,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:13:31,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:13:31,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:13:31,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:13:31,806 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:13:31,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:13:31,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:13:31,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:13:31,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:13:31,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:13:31,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:13:31,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:13:31,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:13:31,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:13:31,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:13:31,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:13:31,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:13:31,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:13:31,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:13:31,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:13:32,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:13:32,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:13:32,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:13:32,142 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:13:32,142 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:13:32,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i [2019-10-13 19:13:32,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcb49991/c03e0c0392374b64b902ec889163f37a/FLAG8638f90b1 [2019-10-13 19:13:32,798 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:13:32,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i [2019-10-13 19:13:32,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcb49991/c03e0c0392374b64b902ec889163f37a/FLAG8638f90b1 [2019-10-13 19:13:33,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fcb49991/c03e0c0392374b64b902ec889163f37a [2019-10-13 19:13:33,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:13:33,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:13:33,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:13:33,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:13:33,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:13:33,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7180328c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33, skipping insertion in model container [2019-10-13 19:13:33,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,119 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:13:33,177 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:13:33,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:13:33,646 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:13:33,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:13:33,754 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:13:33,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33 WrapperNode [2019-10-13 19:13:33,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:13:33,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:13:33,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:13:33,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:13:33,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (1/1) ... [2019-10-13 19:13:33,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:13:33,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:13:33,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:13:33,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:13:33,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (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 [2019-10-13 19:13:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:13:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:13:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 19:13:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 19:13:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 19:13:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-13 19:13:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-10-13 19:13:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-10-13 19:13:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2019-10-13 19:13:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2019-10-13 19:13:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:13:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:13:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 19:13:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 19:13:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 19:13:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 19:13:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 19:13:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 19:13:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 19:13:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 19:13:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 19:13:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 19:13:33,899 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 19:13:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 19:13:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 19:13:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 19:13:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 19:13:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 19:13:33,900 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 19:13:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 19:13:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 19:13:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 19:13:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 19:13:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 19:13:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 19:13:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 19:13:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 19:13:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 19:13:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 19:13:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 19:13:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 19:13:33,903 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 19:13:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 19:13:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 19:13:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 19:13:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 19:13:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 19:13:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 19:13:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:13:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 19:13:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 19:13:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 19:13:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 19:13:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 19:13:33,906 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 19:13:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 19:13:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 19:13:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 19:13:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 19:13:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 19:13:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 19:13:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 19:13:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 19:13:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 19:13:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 19:13:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 19:13:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 19:13:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 19:13:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 19:13:33,909 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 19:13:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 19:13:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 19:13:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 19:13:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 19:13:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 19:13:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 19:13:33,910 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 19:13:33,911 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 19:13:33,912 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 19:13:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-13 19:13:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:13:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 19:13:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:13:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-10-13 19:13:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-10-13 19:13:33,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 19:13:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:13:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2019-10-13 19:13:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:13:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2019-10-13 19:13:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:13:33,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:13:33,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:13:34,323 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 19:13:34,512 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:13:34,512 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 19:13:34,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:13:34 BoogieIcfgContainer [2019-10-13 19:13:34,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:13:34,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:13:34,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:13:34,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:13:34,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:13:33" (1/3) ... [2019-10-13 19:13:34,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105a3c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:13:34, skipping insertion in model container [2019-10-13 19:13:34,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:13:33" (2/3) ... [2019-10-13 19:13:34,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105a3c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:13:34, skipping insertion in model container [2019-10-13 19:13:34,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:13:34" (3/3) ... [2019-10-13 19:13:34,523 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2019-10-13 19:13:34,533 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:13:34,542 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:13:34,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:13:34,579 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:13:34,580 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:13:34,580 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:13:34,580 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:13:34,580 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:13:34,581 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:13:34,581 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:13:34,581 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:13:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-10-13 19:13:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:13:34,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:34,616 INFO L380 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] [2019-10-13 19:13:34,618 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:34,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1303429635, now seen corresponding path program 1 times [2019-10-13 19:13:34,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:34,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969477890] [2019-10-13 19:13:34,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:34,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:34,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:13:34,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969477890] [2019-10-13 19:13:34,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:13:34,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:13:34,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715742934] [2019-10-13 19:13:34,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:13:34,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:34,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:13:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:13:34,915 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 4 states. [2019-10-13 19:13:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:35,244 INFO L93 Difference]: Finished difference Result 123 states and 178 transitions. [2019-10-13 19:13:35,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:13:35,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-10-13 19:13:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:35,259 INFO L225 Difference]: With dead ends: 123 [2019-10-13 19:13:35,259 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 19:13:35,263 INFO L600 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 [2019-10-13 19:13:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 19:13:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2019-10-13 19:13:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 19:13:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-10-13 19:13:35,315 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2019-10-13 19:13:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:35,316 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-13 19:13:35,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:13:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-10-13 19:13:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:13:35,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:35,318 INFO L380 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] [2019-10-13 19:13:35,318 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2048382207, now seen corresponding path program 1 times [2019-10-13 19:13:35,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:35,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422740364] [2019-10-13 19:13:35,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:35,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:35,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:13:35,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422740364] [2019-10-13 19:13:35,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:13:35,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:13:35,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784427678] [2019-10-13 19:13:35,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:13:35,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:13:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:13:35,520 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2019-10-13 19:13:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:35,810 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-10-13 19:13:35,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:13:35,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-13 19:13:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:35,812 INFO L225 Difference]: With dead ends: 68 [2019-10-13 19:13:35,812 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 19:13:35,813 INFO L600 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 [2019-10-13 19:13:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 19:13:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-10-13 19:13:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 19:13:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-10-13 19:13:35,823 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2019-10-13 19:13:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:35,823 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-10-13 19:13:35,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:13:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-10-13 19:13:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:13:35,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:35,825 INFO L380 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] [2019-10-13 19:13:35,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1036290808, now seen corresponding path program 1 times [2019-10-13 19:13:35,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:35,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73409878] [2019-10-13 19:13:35,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:35,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:35,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:13:36,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73409878] [2019-10-13 19:13:36,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:13:36,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:13:36,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271166403] [2019-10-13 19:13:36,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:13:36,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:36,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:13:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:13:36,027 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2019-10-13 19:13:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:36,221 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-10-13 19:13:36,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:13:36,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-13 19:13:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:36,225 INFO L225 Difference]: With dead ends: 73 [2019-10-13 19:13:36,228 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 19:13:36,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:13:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 19:13:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-13 19:13:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 19:13:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-10-13 19:13:36,245 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2019-10-13 19:13:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:36,246 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-10-13 19:13:36,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:13:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-10-13 19:13:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:13:36,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:36,250 INFO L380 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] [2019-10-13 19:13:36,250 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1569732746, now seen corresponding path program 1 times [2019-10-13 19:13:36,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:36,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352976706] [2019-10-13 19:13:36,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:36,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:36,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:13:36,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352976706] [2019-10-13 19:13:36,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526843890] [2019-10-13 19:13:36,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:36,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:13:36,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:13:36,651 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:36,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-10-13 19:13:36,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681037731] [2019-10-13 19:13:36,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:13:36,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:13:36,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:13:36,654 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2019-10-13 19:13:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:36,912 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-13 19:13:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:13:36,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-13 19:13:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:36,914 INFO L225 Difference]: With dead ends: 73 [2019-10-13 19:13:36,914 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 19:13:36,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 19:13:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-10-13 19:13:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 19:13:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-10-13 19:13:36,922 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2019-10-13 19:13:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:36,923 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-10-13 19:13:36,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:13:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-10-13 19:13:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:13:36,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:36,925 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:37,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:37,131 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 649760861, now seen corresponding path program 1 times [2019-10-13 19:13:37,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:37,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61351926] [2019-10-13 19:13:37,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:37,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:37,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:13:37,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61351926] [2019-10-13 19:13:37,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:13:37,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:13:37,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664225129] [2019-10-13 19:13:37,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:13:37,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:13:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:13:37,259 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 6 states. [2019-10-13 19:13:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:37,446 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2019-10-13 19:13:37,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:13:37,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-10-13 19:13:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:37,448 INFO L225 Difference]: With dead ends: 67 [2019-10-13 19:13:37,448 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 19:13:37,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:13:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 19:13:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-10-13 19:13:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-13 19:13:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-10-13 19:13:37,456 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2019-10-13 19:13:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:37,457 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-10-13 19:13:37,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:13:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-10-13 19:13:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 19:13:37,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:37,458 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:37,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash 741026599, now seen corresponding path program 1 times [2019-10-13 19:13:37,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:37,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071153896] [2019-10-13 19:13:37,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:37,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:37,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:13:37,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071153896] [2019-10-13 19:13:37,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349996033] [2019-10-13 19:13:37,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:37,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:13:37,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 19:13:37,845 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:37,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-13 19:13:37,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462851620] [2019-10-13 19:13:37,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:13:37,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:37,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:13:37,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:13:37,854 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 10 states. [2019-10-13 19:13:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:38,139 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-10-13 19:13:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:13:38,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-10-13 19:13:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:38,141 INFO L225 Difference]: With dead ends: 77 [2019-10-13 19:13:38,141 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 19:13:38,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 19:13:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2019-10-13 19:13:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 19:13:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-10-13 19:13:38,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 43 [2019-10-13 19:13:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:38,150 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-10-13 19:13:38,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:13:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-10-13 19:13:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:13:38,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:38,153 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:13:38,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:38,357 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:38,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash -362718223, now seen corresponding path program 2 times [2019-10-13 19:13:38,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:38,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396632213] [2019-10-13 19:13:38,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:38,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:38,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 19:13:38,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396632213] [2019-10-13 19:13:38,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69040542] [2019-10-13 19:13:38,553 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:38,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:13:38,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:38,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:13:38,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 19:13:38,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:13:38,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-10-13 19:13:38,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247524877] [2019-10-13 19:13:38,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:13:38,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:13:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:38,754 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 6 states. [2019-10-13 19:13:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:38,819 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-10-13 19:13:38,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:13:38,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-13 19:13:38,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:38,821 INFO L225 Difference]: With dead ends: 80 [2019-10-13 19:13:38,823 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 19:13:38,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:13:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 19:13:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-10-13 19:13:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 19:13:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-10-13 19:13:38,832 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 51 [2019-10-13 19:13:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:38,833 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-10-13 19:13:38,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:13:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-10-13 19:13:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 19:13:38,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:38,834 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:13:39,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:39,039 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:39,040 INFO L82 PathProgramCache]: Analyzing trace with hash 81529328, now seen corresponding path program 1 times [2019-10-13 19:13:39,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:39,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976848659] [2019-10-13 19:13:39,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:39,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:39,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:13:40,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976848659] [2019-10-13 19:13:40,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006484717] [2019-10-13 19:13:40,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:40,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-13 19:13:40,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:40,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:13:40,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:40,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:40,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:40,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:13:40,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:40,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:13:40,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:40,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:40,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:40,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-13 19:13:40,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:40,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:13:40,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:40,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:40,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:40,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-10-13 19:13:40,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:40,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:40,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 106 [2019-10-13 19:13:40,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:13:40,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:13:40,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:40,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-13 19:13:40,630 INFO L567 ElimStorePlain]: treesize reduction 195, result has 17.0 percent of original size [2019-10-13 19:13:40,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:40,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-10-13 19:13:41,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 19:13:41,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:41,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:41,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:41,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-10-13 19:13:41,311 INFO L341 Elim1Store]: treesize reduction 24, result has 66.7 percent of original size [2019-10-13 19:13:41,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 75 [2019-10-13 19:13:41,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:41,342 INFO L567 ElimStorePlain]: treesize reduction 58, result has 42.0 percent of original size [2019-10-13 19:13:41,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:41,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:42 [2019-10-13 19:13:42,153 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int) (dll_update_at_~data Int)) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (+ |c_dll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) dll_update_at_~head.offset dll_update_at_~data))))) is different from true [2019-10-13 19:13:42,170 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_BEFORE_CALL_2|], 10=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|]} [2019-10-13 19:13:42,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:13:42,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-10-13 19:13:42,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:42,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:42,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:13:42,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:42,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2019-10-13 19:13:42,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:42,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:42,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:42,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:13:42,234 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:13:42,255 INFO L567 ElimStorePlain]: treesize reduction 30, result has 45.5 percent of original size [2019-10-13 19:13:42,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:42,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:14 [2019-10-13 19:13:42,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:13:42,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2019-10-13 19:13:42,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:13:42,625 INFO L567 ElimStorePlain]: treesize reduction 8, result has 46.7 percent of original size [2019-10-13 19:13:42,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:13:42,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 19:13:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-10-13 19:13:42,681 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:42,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 53 [2019-10-13 19:13:42,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029087559] [2019-10-13 19:13:42,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-13 19:13:42,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-13 19:13:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2486, Unknown=1, NotChecked=100, Total=2756 [2019-10-13 19:13:42,684 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 53 states. [2019-10-13 19:13:48,202 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-10-13 19:13:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:55,032 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2019-10-13 19:13:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 19:13:55,033 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-10-13 19:13:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:55,036 INFO L225 Difference]: With dead ends: 122 [2019-10-13 19:13:55,037 INFO L226 Difference]: Without dead ends: 119 [2019-10-13 19:13:55,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=592, Invalid=7590, Unknown=12, NotChecked=178, Total=8372 [2019-10-13 19:13:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-13 19:13:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2019-10-13 19:13:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-13 19:13:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-10-13 19:13:55,057 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 52 [2019-10-13 19:13:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:55,058 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-10-13 19:13:55,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-13 19:13:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2019-10-13 19:13:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 19:13:55,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:55,060 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:13:55,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:55,267 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:55,268 INFO L82 PathProgramCache]: Analyzing trace with hash 556745516, now seen corresponding path program 1 times [2019-10-13 19:13:55,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:55,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756999775] [2019-10-13 19:13:55,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:55,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:55,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 19:13:55,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756999775] [2019-10-13 19:13:55,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635669878] [2019-10-13 19:13:55,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:55,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:13:55,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 19:13:55,528 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:55,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-13 19:13:55,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971118594] [2019-10-13 19:13:55,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:13:55,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:13:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:13:55,530 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 10 states. [2019-10-13 19:13:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:55,842 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2019-10-13 19:13:55,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:13:55,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-13 19:13:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:55,844 INFO L225 Difference]: With dead ends: 121 [2019-10-13 19:13:55,845 INFO L226 Difference]: Without dead ends: 95 [2019-10-13 19:13:55,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-13 19:13:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2019-10-13 19:13:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-13 19:13:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2019-10-13 19:13:55,868 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 53 [2019-10-13 19:13:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:55,869 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2019-10-13 19:13:55,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:13:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2019-10-13 19:13:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 19:13:55,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:55,871 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:56,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:56,075 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash 968301521, now seen corresponding path program 2 times [2019-10-13 19:13:56,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:56,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601204128] [2019-10-13 19:13:56,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:56,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:56,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:13:56,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601204128] [2019-10-13 19:13:56,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813310673] [2019-10-13 19:13:56,228 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:56,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:13:56,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:56,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 19:13:56,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 19:13:56,481 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:56,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-10-13 19:13:56,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073683432] [2019-10-13 19:13:56,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:13:56,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:13:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:13:56,486 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand 12 states. [2019-10-13 19:13:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:57,101 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-10-13 19:13:57,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:13:57,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-13 19:13:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:57,103 INFO L225 Difference]: With dead ends: 134 [2019-10-13 19:13:57,104 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 19:13:57,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:13:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 19:13:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2019-10-13 19:13:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 19:13:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2019-10-13 19:13:57,132 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 53 [2019-10-13 19:13:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:57,133 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2019-10-13 19:13:57,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:13:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2019-10-13 19:13:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 19:13:57,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:57,139 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:13:57,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:57,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 524255485, now seen corresponding path program 3 times [2019-10-13 19:13:57,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:57,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224281874] [2019-10-13 19:13:57,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:57,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:57,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 19:13:57,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224281874] [2019-10-13 19:13:57,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789759043] [2019-10-13 19:13:57,461 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:57,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 19:13:57,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:57,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:13:57,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 19:13:57,697 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:13:57,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-10-13 19:13:57,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149631028] [2019-10-13 19:13:57,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:13:57,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:13:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:13:57,699 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 10 states. [2019-10-13 19:13:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:58,050 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2019-10-13 19:13:58,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:13:58,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-13 19:13:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:58,052 INFO L225 Difference]: With dead ends: 122 [2019-10-13 19:13:58,052 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 19:13:58,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:13:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 19:13:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-10-13 19:13:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-13 19:13:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-10-13 19:13:58,077 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 53 [2019-10-13 19:13:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:58,077 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-10-13 19:13:58,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:13:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-10-13 19:13:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 19:13:58,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:58,079 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 19:13:58,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:58,286 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1877916999, now seen corresponding path program 4 times [2019-10-13 19:13:58,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:58,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015476242] [2019-10-13 19:13:58,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:58,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:58,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 19:13:58,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015476242] [2019-10-13 19:13:58,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688059813] [2019-10-13 19:13:58,439 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:58,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 19:13:58,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:13:58,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:13:58,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 19:13:58,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:13:58,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-10-13 19:13:58,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946017792] [2019-10-13 19:13:58,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:13:58,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:13:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:58,690 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 6 states. [2019-10-13 19:13:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:58,754 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-10-13 19:13:58,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:13:58,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-13 19:13:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:58,756 INFO L225 Difference]: With dead ends: 112 [2019-10-13 19:13:58,756 INFO L226 Difference]: Without dead ends: 62 [2019-10-13 19:13:58,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:13:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-13 19:13:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-13 19:13:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 19:13:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-10-13 19:13:58,767 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 61 [2019-10-13 19:13:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:58,769 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-10-13 19:13:58,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:13:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-10-13 19:13:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 19:13:58,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:58,772 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:13:58,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:58,979 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:58,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2080104955, now seen corresponding path program 1 times [2019-10-13 19:13:58,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:58,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92138992] [2019-10-13 19:13:58,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:58,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:58,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 19:13:59,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92138992] [2019-10-13 19:13:59,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895812972] [2019-10-13 19:13:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:13:59,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:13:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 19:13:59,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:13:59,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2019-10-13 19:13:59,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738979175] [2019-10-13 19:13:59,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:13:59,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:13:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:13:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:13:59,330 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 6 states. [2019-10-13 19:13:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:13:59,394 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-10-13 19:13:59,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:13:59,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-10-13 19:13:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:13:59,395 INFO L225 Difference]: With dead ends: 66 [2019-10-13 19:13:59,395 INFO L226 Difference]: Without dead ends: 62 [2019-10-13 19:13:59,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:13:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-13 19:13:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-13 19:13:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 19:13:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-10-13 19:13:59,404 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 62 [2019-10-13 19:13:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:13:59,404 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-10-13 19:13:59,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:13:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-10-13 19:13:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 19:13:59,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:13:59,405 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:13:59,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:13:59,610 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:13:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:13:59,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1911919487, now seen corresponding path program 1 times [2019-10-13 19:13:59,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:13:59,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186501838] [2019-10-13 19:13:59,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:59,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:13:59,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:13:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:13:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:14:00,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186501838] [2019-10-13 19:14:00,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972142468] [2019-10-13 19:14:00,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:14:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:00,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-13 19:14:00,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:14:00,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:14:00,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:00,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:00,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:14:00,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:14:00,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:00,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:14:00,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:00,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:00,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:14:00,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-13 19:14:00,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:14:00,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-13 19:14:00,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:00,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:00,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:14:01,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-10-13 19:14:01,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:14:01,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:01,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 106 [2019-10-13 19:14:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:14:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:14:01,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:01,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:14:01,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:01,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:01,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-10-13 19:14:01,173 INFO L567 ElimStorePlain]: treesize reduction 515, result has 7.0 percent of original size [2019-10-13 19:14:01,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:14:01,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-10-13 19:14:03,594 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset Int)) (and (<= dll_update_at_~head.offset |c_dll_update_at_#in~head.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_dll_update_at_#in~head.base|) dll_update_at_~head.offset)))))) is different from true [2019-10-13 19:14:03,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:14:03,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:14:03,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:14:03,665 INFO L341 Elim1Store]: treesize reduction 24, result has 68.4 percent of original size [2019-10-13 19:14:03,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 83 [2019-10-13 19:14:03,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:03,703 INFO L567 ElimStorePlain]: treesize reduction 66, result has 41.6 percent of original size [2019-10-13 19:14:03,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:14:03,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:44 [2019-10-13 19:14:04,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-10-13 19:14:04,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:04,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:04,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:14:04,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2019-10-13 19:14:04,105 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_28|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-10-13 19:14:04,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 84 [2019-10-13 19:14:04,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:04,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:04,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:14:04,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:04,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 259 [2019-10-13 19:14:04,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:04,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:04,284 INFO L567 ElimStorePlain]: treesize reduction 212, result has 25.9 percent of original size [2019-10-13 19:14:04,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:14:04,285 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:47 [2019-10-13 19:14:05,125 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|, |#memory_int|]} [2019-10-13 19:14:05,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:05,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2019-10-13 19:14:05,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:05,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:05,139 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:14:05,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:05,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:05,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 52 [2019-10-13 19:14:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:05,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:14:05,177 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:14:05,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:05,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:14:05,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-10-13 19:14:05,220 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:14:05,262 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-10-13 19:14:05,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:14:05,264 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2019-10-13 19:14:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-10-13 19:14:05,329 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:14:05,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 55 [2019-10-13 19:14:05,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771193421] [2019-10-13 19:14:05,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-13 19:14:05,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-13 19:14:05,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2679, Unknown=1, NotChecked=104, Total=2970 [2019-10-13 19:14:05,332 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 55 states. [2019-10-13 19:14:09,230 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-13 19:14:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:11,413 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2019-10-13 19:14:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-13 19:14:11,413 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 63 [2019-10-13 19:14:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:11,414 INFO L225 Difference]: With dead ends: 119 [2019-10-13 19:14:11,414 INFO L226 Difference]: Without dead ends: 107 [2019-10-13 19:14:11,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2459 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=648, Invalid=8285, Unknown=1, NotChecked=186, Total=9120 [2019-10-13 19:14:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-13 19:14:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2019-10-13 19:14:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 19:14:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-13 19:14:11,425 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 63 [2019-10-13 19:14:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:11,426 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-13 19:14:11,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-13 19:14:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-13 19:14:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 19:14:11,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:11,427 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:14:11,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:14:11,632 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1110625605, now seen corresponding path program 2 times [2019-10-13 19:14:11,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:11,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937211056] [2019-10-13 19:14:11,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:11,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:11,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 19:14:11,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937211056] [2019-10-13 19:14:11,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476503607] [2019-10-13 19:14:11,815 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:14:11,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:14:11,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:14:11,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 19:14:11,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:14:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 19:14:12,006 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:14:12,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2019-10-13 19:14:12,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114454826] [2019-10-13 19:14:12,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:14:12,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:14:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:14:12,008 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 11 states. [2019-10-13 19:14:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:12,300 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-10-13 19:14:12,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:14:12,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-13 19:14:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:12,301 INFO L225 Difference]: With dead ends: 63 [2019-10-13 19:14:12,301 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:12,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:14:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:12,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-10-13 19:14:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:12,303 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:12,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:14:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:12,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:12,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:14:12,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:12,832 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-10-13 19:14:13,014 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-10-13 19:14:13,240 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-10-13 19:14:13,481 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-10-13 19:14:13,660 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2019-10-13 19:14:13,812 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2019-10-13 19:14:14,038 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-10-13 19:14:14,042 INFO L439 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse7 (<= (+ dll_update_at_~index 1) |dll_update_at_#in~index|)) (.cse4 (= |#memory_int| |old(#memory_int)|)) (.cse5 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse6 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (let ((.cse3 (= dll_update_at_~index |dll_update_at_#in~index|)) (.cse0 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse1 (+ |dll_update_at_#in~head.offset| 4)) (.cse2 (and .cse7 .cse4 .cse5 .cse6 (<= 2 |dll_update_at_#in~index|)))) (and (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse1) dll_update_at_~head.offset)) .cse2 (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (not (= (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_3) 0) 2))) .cse3) (or (and (= |dll_update_at_#in~head.base| dll_update_at_~head.base) .cse4 .cse5 .cse3 .cse0 .cse6 (= dll_update_at_~head.offset |dll_update_at_#in~head.offset|)) (and (<= 1 |dll_update_at_#in~index|) (= dll_update_at_~head.base (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse1)) .cse4 .cse7 .cse5 .cse6) .cse2)))) [2019-10-13 19:14:14,042 INFO L443 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2019-10-13 19:14:14,042 INFO L439 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 19:14:14,042 INFO L443 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2019-10-13 19:14:14,042 INFO L443 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2019-10-13 19:14:14,042 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:14,042 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 19:14:14,042 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:14,043 INFO L446 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2019-10-13 19:14:14,043 INFO L443 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2019-10-13 19:14:14,043 INFO L446 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2019-10-13 19:14:14,043 INFO L443 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2019-10-13 19:14:14,043 INFO L439 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 19:14:14,043 INFO L439 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse0 (= 0 dll_create_~head~0.offset)) (.cse1 (= 1 (select |#valid| dll_create_~new_head~0.base))) (.cse2 (= (select |#valid| dll_create_~head~0.base) 1))) (or (and (= |#valid| |old(#valid)|) (= dll_create_~len |dll_create_#in~len|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) .cse0 (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 dll_create_~head~0.base)) (and .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| dll_create_~new_head~0.base) (+ dll_create_~new_head~0.offset 4)) dll_create_~new_head~0.base)) (not (= (select (select |#memory_$Pointer$.base| dll_create_~head~0.base) 4) dll_create_~head~0.base)) .cse0 (= 0 dll_create_~new_head~0.offset)) (and .cse1 .cse2 (<= |dll_create_#in~len| (+ dll_create_~len 1))))) [2019-10-13 19:14:14,043 INFO L443 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2019-10-13 19:14:14,043 INFO L443 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2019-10-13 19:14:14,043 INFO L446 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2019-10-13 19:14:14,043 INFO L443 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2019-10-13 19:14:14,043 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:14,044 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:14,044 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:14,044 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:14,045 INFO L439 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (forall ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (not (= (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) 0) 2)))) (.cse1 (and (= |dll_get_data_at_#in~index| dll_get_data_at_~index) (exists ((v_main_~s~0.base_BEFORE_CALL_3 Int)) (= 2 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) 0))) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base)))) (and (or (<= 1 |dll_get_data_at_#in~index|) .cse0 .cse1) (let ((.cse2 (<= (+ dll_get_data_at_~index 1) |dll_get_data_at_#in~index|))) (or (and (<= 2 |dll_get_data_at_#in~index|) .cse2) .cse0 (and (or (<= (+ |dll_get_data_at_#in~head.offset| 1) 0) (<= 1 |dll_get_data_at_#in~head.offset|) (and (= (select (select |#memory_$Pointer$.offset| |dll_get_data_at_#in~head.base|) 4) dll_get_data_at_~head.offset) (= (select (select |#memory_$Pointer$.base| |dll_get_data_at_#in~head.base|) 4) dll_get_data_at_~head.base))) .cse2) .cse1)))) [2019-10-13 19:14:14,045 INFO L443 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2019-10-13 19:14:14,045 INFO L443 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2019-10-13 19:14:14,045 INFO L446 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2019-10-13 19:14:14,045 INFO L443 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2019-10-13 19:14:14,045 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2019-10-13 19:14:14,045 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2019-10-13 19:14:14,045 INFO L443 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2019-10-13 19:14:14,045 INFO L439 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (+ main_~len~0 1)) (.cse0 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse11 (* 2 main_~len~0))) (let ((.cse2 (= main_~s~0.offset 0)) (.cse3 (<= .cse11 (+ main_~new_data~0 1))) (.cse4 (<= .cse11 (+ .cse0 1))) (.cse5 (<= main_~new_data~0 .cse10)) (.cse6 (<= .cse0 .cse10)) (.cse7 (not (= .cse9 main_~s~0.base))) (.cse8 (= main_~len~0 2)) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (or (and (<= main_~expected~0 .cse0) (<= .cse0 main_~expected~0) (= main_~len~0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~i~0) (<= main_~i~0 1) .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 (= 2 .cse1) .cse6 .cse7 .cse8 (= main_~i~0 0) (= main_~expected~0 .cse1)))))) [2019-10-13 19:14:14,045 INFO L443 ceAbstractionStarter]: For program point L624-1(line 624) no Hoare annotation was computed. [2019-10-13 19:14:14,046 INFO L443 ceAbstractionStarter]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2019-10-13 19:14:14,046 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2019-10-13 19:14:14,046 INFO L439 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse0 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base))) (.cse1 (= main_~s~0.offset 0)) (.cse2 (= main_~len~0 2))) (or (and (and (<= (+ main_~i~0 main_~len~0) main_~new_data~0) (<= main_~new_data~0 (+ main_~i~0 2)) .cse0) .cse1 .cse2 (= main_~i~0 0)) (and (and (and (<= 1 main_~i~0) .cse0 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) .cse1 (<= (* 2 main_~len~0) (+ main_~new_data~0 1)) .cse2 (<= main_~new_data~0 (+ main_~len~0 1))) (<= main_~i~0 1)))) [2019-10-13 19:14:14,046 INFO L443 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2019-10-13 19:14:14,046 INFO L443 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2019-10-13 19:14:14,046 INFO L439 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse0 (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= main_~s~0.offset 0) (<= 0 main_~i~0) (= main_~len~0 2)))) (or (and (<= 2 main_~i~0) .cse0) (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse4 (* 2 main_~len~0)) (.cse1 (select (select |#memory_int| .cse3) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse2 (+ main_~len~0 1))) (and (<= .cse1 .cse2) .cse0 (not (= .cse3 main_~s~0.base)) (<= .cse4 (+ main_~new_data~0 1)) (<= .cse4 (+ .cse1 1)) (<= main_~new_data~0 .cse2)))))) [2019-10-13 19:14:14,046 INFO L446 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: true [2019-10-13 19:14:14,046 INFO L439 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 19:14:14,047 INFO L439 ceAbstractionStarter]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse0 (<= 1 main_~i~0)) (.cse2 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse1 (not (= .cse8 main_~s~0.base))) (.cse3 (= main_~s~0.offset 0)) (.cse4 (= main_~len~0 2))) (or (and .cse0 (<= main_~i~0 1) .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (* 2 main_~len~0)) (.cse5 (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse6 (+ main_~len~0 1))) (and (<= .cse5 .cse6) .cse0 .cse2 .cse3 .cse1 (<= .cse7 (+ main_~new_data~0 1)) (<= .cse7 (+ .cse5 1)) (<= main_~new_data~0 .cse6) .cse4)) (and .cse1 .cse3 .cse4 (= main_~i~0 0))))) [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2019-10-13 19:14:14,047 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 19:14:14,047 INFO L439 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2019-10-13 19:14:14,047 INFO L439 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: (= |#valid| |old(#valid)|) [2019-10-13 19:14:14,047 INFO L446 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2019-10-13 19:14:14,047 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2019-10-13 19:14:14,048 INFO L443 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2019-10-13 19:14:14,048 INFO L443 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2019-10-13 19:14:14,056 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,059 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,059 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,060 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,061 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,063 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,072 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,072 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,073 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,073 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,073 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,075 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,076 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,076 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,082 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,082 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,091 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,092 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,092 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,092 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,092 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,095 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,101 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:14 BoogieIcfgContainer [2019-10-13 19:14:14,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:14,120 INFO L168 Benchmark]: Toolchain (without parser) took 41018.18 ms. Allocated memory was 137.4 MB in the beginning and 447.2 MB in the end (delta: 309.9 MB). Free memory was 101.0 MB in the beginning and 258.1 MB in the end (delta: -157.1 MB). Peak memory consumption was 331.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:14,121 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:14,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 652.92 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 165.4 MB in the end (delta: -64.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:14,122 INFO L168 Benchmark]: Boogie Preprocessor took 78.29 ms. Allocated memory is still 200.8 MB. Free memory was 165.4 MB in the beginning and 162.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:14,122 INFO L168 Benchmark]: RCFGBuilder took 678.68 ms. Allocated memory is still 200.8 MB. Free memory was 162.1 MB in the beginning and 113.9 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:14,123 INFO L168 Benchmark]: TraceAbstraction took 39603.65 ms. Allocated memory was 200.8 MB in the beginning and 447.2 MB in the end (delta: 246.4 MB). Free memory was 113.2 MB in the beginning and 258.1 MB in the end (delta: -144.8 MB). Peak memory consumption was 279.9 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:14,125 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 652.92 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 165.4 MB in the end (delta: -64.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.29 ms. Allocated memory is still 200.8 MB. Free memory was 165.4 MB in the beginning and 162.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 678.68 ms. Allocated memory is still 200.8 MB. Free memory was 162.1 MB in the beginning and 113.9 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39603.65 ms. Allocated memory was 200.8 MB in the beginning and 447.2 MB in the end (delta: 246.4 MB). Free memory was 113.2 MB in the beginning and 258.1 MB in the end (delta: -144.8 MB). Peak memory consumption was 279.9 MB. Max. memory is 7.1 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$.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$.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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - 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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - 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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant [2019-10-13 19:14:14,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((1 <= i && i <= 1) && !(#memory_$Pointer$[s][4] == s)) && len == unknown-#memory_int-unknown[s][s]) && s == 0) && len == 2) || ((((((((unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1 && 1 <= i) && len == unknown-#memory_int-unknown[s][s]) && s == 0) && !(#memory_$Pointer$[s][4] == s)) && 2 * len <= new_data + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && new_data <= len + 1) && len == 2)) || (((!(#memory_$Pointer$[s][4] == s) && s == 0) && len == 2) && i == 0) - InvariantResult [Line: 607]: Loop Invariant [2019-10-13 19:14:14,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,151 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,152 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((data == \old(data) && #memory_$Pointer$[head][head + 4] == head) || ((((index + 1 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index))) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: !(\old(unknown-#memory_int-unknown)[v_main_~s~0.base_BEFORE_CALL_3][0] == 2))) || index == \old(index)) && ((((((((head == head && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && index == \old(index)) && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head) || (((((1 <= \old(index) && head == \old(#memory_$Pointer$)[head][head + 4]) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((index + 1 <= \old(index) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index))) - InvariantResult [Line: 600]: Loop Invariant [2019-10-13 19:14:14,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,168 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,168 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-13 19:14:14,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((1 <= \old(index) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: !(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][0] == 2))) || (((\old(index) == index && (\exists v_main_~s~0.base_BEFORE_CALL_3 : int :: 2 == unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][0])) && head == head) && head == head)) && ((((2 <= \old(index) && index + 1 <= \old(index)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: !(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][0] == 2))) || (((head + 1 <= 0 || 1 <= head) || (#memory_$Pointer$[head][4] == head && #memory_$Pointer$[head][4] == head)) && index + 1 <= \old(index))) || (((\old(index) == index && (\exists v_main_~s~0.base_BEFORE_CALL_3 : int :: 2 == unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][0])) && head == head) && head == head)) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2019-10-13 19:14:14,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,171 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,171 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,173 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 19:14:14,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((\valid == \old(\valid) && len == \old(len)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head) && \old(unknown-#length-unknown) == unknown-#length-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head) || (((((1 == \valid[new_head] && \valid[head] == 1) && !(#memory_$Pointer$[new_head][new_head + 4] == new_head)) && !(#memory_$Pointer$[head][4] == head)) && 0 == head) && 0 == new_head)) || ((1 == \valid[new_head] && \valid[head] == 1) && \old(len) <= len + 1) - InvariantResult [Line: 622]: Loop Invariant [2019-10-13 19:14:14,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,177 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,177 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,180 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 19:14:14,180 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 19:14:14,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 19:14:14,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 19:14:14,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (2 <= i && ((len == unknown-#memory_int-unknown[s][s] && s == 0) && 0 <= i) && len == 2) || (((((unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1 && ((len == unknown-#memory_int-unknown[s][s] && s == 0) && 0 <= i) && len == 2) && !(#memory_$Pointer$[s][4] == s)) && 2 * len <= new_data + 1) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && new_data <= len + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 64 locations, 1 error locations. Result: SAFE, OverallTime: 39.4s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 527 SDtfs, 905 SDslu, 1599 SDs, 0 SdLazy, 4905 SolverSat, 500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 962 GetRequests, 639 SyntacticMatches, 2 SemanticMatches, 321 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4688 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 167 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 82 PreInvPairs, 118 NumberOfFragments, 847 HoareAnnotationTreeSize, 82 FomulaSimplifications, 3988 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 2587 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1282 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1259 ConstructedInterpolants, 42 QuantifiedInterpolants, 357409 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 371/490 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...