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-673a906-m [2019-10-02 10:57:12,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:57:12,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:57:12,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:57:12,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:57:12,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:57:12,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:57:12,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:57:12,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:57:12,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:57:12,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:57:12,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:57:12,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:57:12,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:57:12,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:57:12,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:57:12,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:57:12,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:57:12,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:57:12,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:57:12,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:57:12,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:57:12,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:57:12,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:57:12,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:57:12,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:57:12,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:57:12,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:57:12,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:57:12,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:57:12,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:57:12,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:57:12,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:57:12,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:57:12,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:57:12,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:57:12,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:57:12,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:57:12,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:57:12,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:57:12,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:57:12,295 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-02 10:57:12,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:57:12,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:57:12,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:57:12,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:57:12,312 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:57:12,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:57:12,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:57:12,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:57:12,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:57:12,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:57:12,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:57:12,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:57:12,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:57:12,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:57:12,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:57:12,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:57:12,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:57:12,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:57:12,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:57:12,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:57:12,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:57:12,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:57:12,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:57:12,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:57:12,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:57:12,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:57:12,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:57:12,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:57:12,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:57:12,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:57:12,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:57:12,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:57:12,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:57:12,364 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:57:12,365 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-02 10:57:12,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4692e359/8eef87de4f0e42779f16389650c0daae/FLAGef90c0d8e [2019-10-02 10:57:12,958 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:57:12,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i [2019-10-02 10:57:12,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4692e359/8eef87de4f0e42779f16389650c0daae/FLAGef90c0d8e [2019-10-02 10:57:13,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4692e359/8eef87de4f0e42779f16389650c0daae [2019-10-02 10:57:13,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:57:13,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:57:13,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:57:13,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:57:13,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:57:13,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:13,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602e7f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13, skipping insertion in model container [2019-10-02 10:57:13,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:13,355 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:57:13,413 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:57:13,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:57:13,876 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:57:13,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:57:13,999 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:57:14,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13 WrapperNode [2019-10-02 10:57:14,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:57:14,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:57:14,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:57:14,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:57:14,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:14,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:14,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:14,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:14,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:14,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:14,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (1/1) ... [2019-10-02 10:57:14,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:57:14,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:57:14,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:57:14,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:57:14,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (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-02 10:57:14,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:57:14,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:57:14,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:57:14,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:57:14,142 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 10:57:14,142 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-02 10:57:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-10-02 10:57:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-10-02 10:57:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2019-10-02 10:57:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2019-10-02 10:57:14,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:57:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:57:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:57:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:57:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:57:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:57:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:57:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:57:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:57:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:57:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:57:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:57:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:57:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:57:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:57:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:57:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:57:14,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:57:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:57:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:57:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:57:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:57:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:57:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:57:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:57:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:57:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:57:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:57:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:57:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:57:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:57:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:57:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:57:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:57:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:57:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:57:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:57:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:57:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:57:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:57:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:57:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:57:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:57:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:57:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:57:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:57:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:57:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:57:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:57:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:57:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:57:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:57:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:57:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:57:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:57:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:57:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:57:14,156 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:57:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 10:57:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:57:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:57:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:57:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 10:57:14,157 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:57:14,158 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:57:14,158 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 10:57:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:57:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:57:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 10:57:14,159 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:57:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:57:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:57:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:57:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:57:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:57:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:57:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:57:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:57:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:57:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:57:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:57:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:57:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:57:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:57:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:57:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:57:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:57:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:57:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:57:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:57:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:57:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:57:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:57:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:57:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:57:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:57:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:57:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:57:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:57:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:57:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:57:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:57:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:57:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:57:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:57:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:57:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:57:14,167 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 10:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-02 10:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:57:14,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-10-02 10:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-10-02 10:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2019-10-02 10:57:14,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2019-10-02 10:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:57:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:57:14,580 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 10:57:14,759 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:57:14,760 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-02 10:57:14,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:57:14 BoogieIcfgContainer [2019-10-02 10:57:14,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:57:14,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:57:14,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:57:14,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:57:14,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:57:13" (1/3) ... [2019-10-02 10:57:14,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3874bd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:57:14, skipping insertion in model container [2019-10-02 10:57:14,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:57:13" (2/3) ... [2019-10-02 10:57:14,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3874bd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:57:14, skipping insertion in model container [2019-10-02 10:57:14,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:57:14" (3/3) ... [2019-10-02 10:57:14,771 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2019-10-02 10:57:14,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:57:14,790 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:57:14,807 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:57:14,841 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:57:14,842 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:57:14,842 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:57:14,843 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:57:14,843 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:57:14,843 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:57:14,843 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:57:14,844 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:57:14,844 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:57:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-10-02 10:57:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 10:57:14,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:14,873 INFO L411 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-02 10:57:14,876 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1303429635, now seen corresponding path program 1 times [2019-10-02 10:57:14,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:14,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:14,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:14,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:14,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:15,057 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-02 10:57:15,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:57:15,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:57:15,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:57:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:57:15,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:57:15,080 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2019-10-02 10:57:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:15,110 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2019-10-02 10:57:15,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:57:15,111 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2019-10-02 10:57:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:15,124 INFO L225 Difference]: With dead ends: 86 [2019-10-02 10:57:15,124 INFO L226 Difference]: Without dead ends: 38 [2019-10-02 10:57:15,130 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:57:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-02 10:57:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-02 10:57:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-02 10:57:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-10-02 10:57:15,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2019-10-02 10:57:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:15,180 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-02 10:57:15,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:57:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-10-02 10:57:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 10:57:15,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:15,182 INFO L411 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-02 10:57:15,183 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2048382207, now seen corresponding path program 1 times [2019-10-02 10:57:15,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:15,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:15,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:15,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:15,298 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-02 10:57:15,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:57:15,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:57:15,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:57:15,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:57:15,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:57:15,302 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2019-10-02 10:57:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:15,380 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-10-02 10:57:15,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:57:15,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-02 10:57:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:15,383 INFO L225 Difference]: With dead ends: 68 [2019-10-02 10:57:15,383 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 10:57:15,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:57:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 10:57:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-10-02 10:57:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 10:57:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-10-02 10:57:15,392 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2019-10-02 10:57:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:15,393 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-10-02 10:57:15,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:57:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-10-02 10:57:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:57:15,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:15,394 INFO L411 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-02 10:57:15,394 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:15,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1036290808, now seen corresponding path program 1 times [2019-10-02 10:57:15,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:15,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:15,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:15,479 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-02 10:57:15,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:57:15,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:57:15,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:57:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:57:15,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:57:15,481 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 3 states. [2019-10-02 10:57:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:15,516 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-10-02 10:57:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:57:15,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 10:57:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:15,518 INFO L225 Difference]: With dead ends: 73 [2019-10-02 10:57:15,518 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 10:57:15,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:57:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 10:57:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-02 10:57:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 10:57:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-10-02 10:57:15,526 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 30 [2019-10-02 10:57:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:15,526 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-10-02 10:57:15,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:57:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-10-02 10:57:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:57:15,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:15,528 INFO L411 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-02 10:57:15,528 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1569732746, now seen corresponding path program 1 times [2019-10-02 10:57:15,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:15,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:15,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:15,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:15,650 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-02 10:57:15,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:15,651 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:15,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:15,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:57:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:57:15,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-02 10:57:15,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:57:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:57:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:57:15,870 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 6 states. [2019-10-02 10:57:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:15,967 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-02 10:57:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:57:15,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-02 10:57:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:15,971 INFO L225 Difference]: With dead ends: 73 [2019-10-02 10:57:15,971 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 10:57:15,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:57:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 10:57:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-10-02 10:57:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 10:57:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2019-10-02 10:57:15,982 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2019-10-02 10:57:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:15,984 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2019-10-02 10:57:15,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:57:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2019-10-02 10:57:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 10:57:15,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:15,987 INFO L411 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-02 10:57:15,987 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:15,988 INFO L82 PathProgramCache]: Analyzing trace with hash 649760861, now seen corresponding path program 1 times [2019-10-02 10:57:15,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:15,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:15,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:15,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:15,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:16,120 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-02 10:57:16,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:57:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:57:16,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:57:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:57:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:57:16,122 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2019-10-02 10:57:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:16,178 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2019-10-02 10:57:16,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:57:16,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-02 10:57:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:16,182 INFO L225 Difference]: With dead ends: 67 [2019-10-02 10:57:16,182 INFO L226 Difference]: Without dead ends: 54 [2019-10-02 10:57:16,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:57:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-02 10:57:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-10-02 10:57:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 10:57:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-10-02 10:57:16,208 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 35 [2019-10-02 10:57:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:16,210 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-10-02 10:57:16,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:57:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-10-02 10:57:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 10:57:16,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:16,213 INFO L411 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-02 10:57:16,213 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:16,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash 741026599, now seen corresponding path program 1 times [2019-10-02 10:57:16,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:16,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:16,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:16,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:16,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:16,342 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-02 10:57:16,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:16,343 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:16,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:16,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:57:16,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:16,563 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-02 10:57:16,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-10-02 10:57:16,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:57:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:57:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:57:16,570 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 7 states. [2019-10-02 10:57:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:16,693 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-10-02 10:57:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:57:16,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-10-02 10:57:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:16,695 INFO L225 Difference]: With dead ends: 77 [2019-10-02 10:57:16,695 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 10:57:16,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:57:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 10:57:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2019-10-02 10:57:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 10:57:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-10-02 10:57:16,712 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 43 [2019-10-02 10:57:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:16,714 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-10-02 10:57:16,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:57:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-10-02 10:57:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 10:57:16,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:16,722 INFO L411 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-02 10:57:16,723 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash -362718223, now seen corresponding path program 2 times [2019-10-02 10:57:16,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:16,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:16,857 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-02 10:57:16,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:16,857 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:57:16,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:57:16,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:57:16,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:57:17,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:17,031 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-02 10:57:17,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:57:17,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-10-02 10:57:17,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 10:57:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 10:57:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:57:17,038 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2019-10-02 10:57:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:17,187 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-10-02 10:57:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 10:57:17,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-02 10:57:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:17,191 INFO L225 Difference]: With dead ends: 81 [2019-10-02 10:57:17,191 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 10:57:17,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-02 10:57:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 10:57:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-10-02 10:57:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 10:57:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-10-02 10:57:17,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 51 [2019-10-02 10:57:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:17,200 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-10-02 10:57:17,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 10:57:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-10-02 10:57:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 10:57:17,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:17,202 INFO L411 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-02 10:57:17,202 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash 81529328, now seen corresponding path program 1 times [2019-10-02 10:57:17,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:17,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:17,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:17,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:57:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:57:18,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:18,427 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:18,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:18,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-02 10:57:18,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:18,634 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-02 10:57:18,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:18,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:18,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:18,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-02 10:57:18,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:18,704 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-02 10:57:18,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:18,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:18,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:18,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-02 10:57:18,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:18,722 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-02 10:57:18,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:18,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:18,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:18,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-10-02 10:57:18,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:18,855 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:18,856 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-02 10:57:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:57:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:57:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:18,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-02 10:57:18,907 INFO L567 ElimStorePlain]: treesize reduction 195, result has 17.0 percent of original size [2019-10-02 10:57:18,908 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-02 10:57:18,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-10-02 10:57:19,362 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-02 10:57:19,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:19,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:19,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:19,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-10-02 10:57:19,486 INFO L341 Elim1Store]: treesize reduction 24, result has 66.7 percent of original size [2019-10-02 10:57:19,486 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-02 10:57:19,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:19,518 INFO L567 ElimStorePlain]: treesize reduction 58, result has 42.0 percent of original size [2019-10-02 10:57:19,519 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-02 10:57:19,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:42 [2019-10-02 10:57:20,450 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-02 10:57:20,466 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_BEFORE_CALL_2|], 10=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|]} [2019-10-02 10:57:20,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:20,474 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-02 10:57:20,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:20,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:20,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:57:20,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:20,518 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-02 10:57:20,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:20,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:20,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:20,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:20,523 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-02 10:57:20,546 INFO L567 ElimStorePlain]: treesize reduction 30, result has 45.5 percent of original size [2019-10-02 10:57:20,547 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-02 10:57:20,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:14 [2019-10-02 10:57:20,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:20,909 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-02 10:57:20,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:20,920 INFO L567 ElimStorePlain]: treesize reduction 8, result has 46.7 percent of original size [2019-10-02 10:57:20,920 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-02 10:57:20,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-02 10:57:20,997 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-02 10:57:21,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:21,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 51 [2019-10-02 10:57:21,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 10:57:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 10:57:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2294, Unknown=1, NotChecked=96, Total=2550 [2019-10-02 10:57:21,004 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 51 states. [2019-10-02 10:57:31,561 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-10-02 10:57:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:37,478 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2019-10-02 10:57:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 10:57:37,479 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-10-02 10:57:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:37,482 INFO L225 Difference]: With dead ends: 122 [2019-10-02 10:57:37,482 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 10:57:37,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=541, Invalid=6927, Unknown=18, NotChecked=170, Total=7656 [2019-10-02 10:57:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 10:57:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2019-10-02 10:57:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 10:57:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-10-02 10:57:37,503 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 52 [2019-10-02 10:57:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:37,504 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-10-02 10:57:37,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 10:57:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2019-10-02 10:57:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 10:57:37,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:37,506 INFO L411 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-02 10:57:37,506 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash 556745516, now seen corresponding path program 1 times [2019-10-02 10:57:37,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:37,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:37,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:37,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:37,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:37,574 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-02 10:57:37,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:37,574 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:37,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:37,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:57:37,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:37,736 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-02 10:57:37,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:37,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 10:57:37,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:57:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:57:37,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:57:37,743 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 8 states. [2019-10-02 10:57:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:37,835 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2019-10-02 10:57:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:57:37,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-02 10:57:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:37,839 INFO L225 Difference]: With dead ends: 121 [2019-10-02 10:57:37,839 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 10:57:37,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:57:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 10:57:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2019-10-02 10:57:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 10:57:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2019-10-02 10:57:37,856 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 53 [2019-10-02 10:57:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:37,856 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2019-10-02 10:57:37,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:57:37,856 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2019-10-02 10:57:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 10:57:37,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:37,858 INFO L411 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-02 10:57:37,859 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash 968301521, now seen corresponding path program 2 times [2019-10-02 10:57:37,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:37,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:57:37,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:37,927 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:38,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:57:38,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:57:38,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:57:38,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 10:57:38,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:38,073 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-02 10:57:38,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:38,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 10:57:38,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:57:38,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:57:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:57:38,078 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand 8 states. [2019-10-02 10:57:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:38,192 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-10-02 10:57:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 10:57:38,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-02 10:57:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:38,193 INFO L225 Difference]: With dead ends: 134 [2019-10-02 10:57:38,194 INFO L226 Difference]: Without dead ends: 93 [2019-10-02 10:57:38,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:57:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-02 10:57:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2019-10-02 10:57:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 10:57:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2019-10-02 10:57:38,228 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 53 [2019-10-02 10:57:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:38,228 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2019-10-02 10:57:38,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:57:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2019-10-02 10:57:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 10:57:38,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:38,231 INFO L411 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-02 10:57:38,232 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:38,232 INFO L82 PathProgramCache]: Analyzing trace with hash 524255485, now seen corresponding path program 3 times [2019-10-02 10:57:38,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:38,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:38,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:57:38,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:38,290 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-02 10:57:38,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:38,291 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:38,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:57:38,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:57:38,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:57:38,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:57:38,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:38,570 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-02 10:57:38,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:38,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 10:57:38,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:57:38,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:57:38,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:57:38,578 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 8 states. [2019-10-02 10:57:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:38,690 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2019-10-02 10:57:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:57:38,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-02 10:57:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:38,699 INFO L225 Difference]: With dead ends: 122 [2019-10-02 10:57:38,699 INFO L226 Difference]: Without dead ends: 89 [2019-10-02 10:57:38,702 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:57:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-02 10:57:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-10-02 10:57:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 10:57:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-10-02 10:57:38,724 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 53 [2019-10-02 10:57:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:38,724 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-10-02 10:57:38,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:57:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-10-02 10:57:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 10:57:38,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:38,726 INFO L411 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-02 10:57:38,727 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1877916999, now seen corresponding path program 4 times [2019-10-02 10:57:38,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:38,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:57:38,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:38,832 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-02 10:57:38,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:38,832 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:38,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:57:38,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:57:38,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:57:38,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:57:38,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:38,995 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-02 10:57:39,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:57:39,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2019-10-02 10:57:39,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 10:57:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 10:57:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:57:39,002 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 10 states. [2019-10-02 10:57:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:39,087 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-10-02 10:57:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 10:57:39,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2019-10-02 10:57:39,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:39,088 INFO L225 Difference]: With dead ends: 112 [2019-10-02 10:57:39,088 INFO L226 Difference]: Without dead ends: 62 [2019-10-02 10:57:39,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:57:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-02 10:57:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-02 10:57:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-02 10:57:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-10-02 10:57:39,096 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 61 [2019-10-02 10:57:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:39,097 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-10-02 10:57:39,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 10:57:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-10-02 10:57:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 10:57:39,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:39,098 INFO L411 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-02 10:57:39,098 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2080104955, now seen corresponding path program 1 times [2019-10-02 10:57:39,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:39,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:57:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:39,155 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-02 10:57:39,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:39,156 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:39,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:39,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:57:39,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:39,302 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-02 10:57:39,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:57:39,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2019-10-02 10:57:39,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:57:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:57:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:57:39,308 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 7 states. [2019-10-02 10:57:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:39,398 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-10-02 10:57:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:57:39,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-10-02 10:57:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:39,400 INFO L225 Difference]: With dead ends: 72 [2019-10-02 10:57:39,400 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 10:57:39,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:57:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 10:57:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-02 10:57:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 10:57:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-02 10:57:39,408 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 62 [2019-10-02 10:57:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:39,408 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-02 10:57:39,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:57:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-02 10:57:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 10:57:39,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:39,409 INFO L411 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-02 10:57:39,410 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1911919487, now seen corresponding path program 1 times [2019-10-02 10:57:39,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:39,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:39,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:39,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:39,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:40,543 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-02 10:57:40,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:40,544 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:40,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:40,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-02 10:57:40,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:40,731 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-02 10:57:40,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:40,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:40,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:40,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-02 10:57:40,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:40,791 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-02 10:57:40,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:40,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:40,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:40,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-02 10:57:40,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:40,803 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-02 10:57:40,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:40,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:40,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:40,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-10-02 10:57:40,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:40,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:40,899 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-02 10:57:40,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:57:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:57:40,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:40,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:57:40,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:40,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:40,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-10-02 10:57:40,960 INFO L567 ElimStorePlain]: treesize reduction 515, result has 7.0 percent of original size [2019-10-02 10:57:40,961 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-02 10:57:40,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-10-02 10:57:42,825 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-02 10:57:42,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:42,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:42,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:42,912 INFO L341 Elim1Store]: treesize reduction 24, result has 68.4 percent of original size [2019-10-02 10:57:42,913 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-02 10:57:42,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:42,953 INFO L567 ElimStorePlain]: treesize reduction 66, result has 41.6 percent of original size [2019-10-02 10:57:42,954 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-02 10:57:42,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:44 [2019-10-02 10:57:43,217 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-02 10:57:43,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:43,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:43,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:57:43,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2019-10-02 10:57:43,302 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_28|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-10-02 10:57:43,306 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-02 10:57:43,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:43,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:43,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:57:43,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:43,430 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-02 10:57:43,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:43,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:43,492 INFO L567 ElimStorePlain]: treesize reduction 212, result has 25.9 percent of original size [2019-10-02 10:57:43,494 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-02 10:57:43,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:47 [2019-10-02 10:57:44,266 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|, |#memory_int|]} [2019-10-02 10:57:44,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:44,275 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-02 10:57:44,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:44,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:44,278 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-02 10:57:44,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:44,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:44,322 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-02 10:57:44,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:44,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:57:44,325 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-02 10:57:44,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:44,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:57:44,360 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-02 10:57:44,361 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:57:44,399 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-10-02 10:57:44,401 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-02 10:57:44,401 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2019-10-02 10:57:44,469 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-02 10:57:44,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:44,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 53 [2019-10-02 10:57:44,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 10:57:44,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 10:57:44,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2481, Unknown=1, NotChecked=100, Total=2756 [2019-10-02 10:57:44,476 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 53 states. [2019-10-02 10:57:52,007 WARN L191 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-10-02 10:57:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:54,806 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-10-02 10:57:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 10:57:54,807 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 63 [2019-10-02 10:57:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:54,808 INFO L225 Difference]: With dead ends: 123 [2019-10-02 10:57:54,808 INFO L226 Difference]: Without dead ends: 111 [2019-10-02 10:57:54,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=580, Invalid=7253, Unknown=3, NotChecked=174, Total=8010 [2019-10-02 10:57:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-02 10:57:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 65. [2019-10-02 10:57:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 10:57:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-02 10:57:54,820 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 63 [2019-10-02 10:57:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:54,820 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-02 10:57:54,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 10:57:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-02 10:57:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 10:57:54,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:57:54,822 INFO L411 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-02 10:57:54,822 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:57:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:57:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1110625605, now seen corresponding path program 2 times [2019-10-02 10:57:54,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:57:54,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:57:54,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:54,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:57:54,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:57:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:57:54,901 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-02 10:57:54,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:57:54,902 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:57:54,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:57:55,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:57:55,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:57:55,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 10:57:55,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:57:55,052 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-02 10:57:55,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:57:55,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 10:57:55,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:57:55,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:57:55,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:57:55,058 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-10-02 10:57:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:57:55,118 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-02 10:57:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:57:55,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-10-02 10:57:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:57:55,119 INFO L225 Difference]: With dead ends: 65 [2019-10-02 10:57:55,119 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 10:57:55,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:57:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 10:57:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 10:57:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 10:57:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 10:57:55,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-10-02 10:57:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:57:55,121 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 10:57:55,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:57:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 10:57:55,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 10:57:55,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 10:57:55,492 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-10-02 10:57:55,668 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-10-02 10:57:55,939 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-10-02 10:57:56,127 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-10-02 10:57:56,310 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2019-10-02 10:57:56,464 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2019-10-02 10:57:56,716 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-10-02 10:57:56,726 INFO L439 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse7 (<= (+ dll_update_at_~index 1) |dll_update_at_#in~index|)) (.cse6 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (let ((.cse0 (and .cse5 .cse7 .cse6 (<= 2 |dll_update_at_#in~index|))) (.cse1 (<= |dll_update_at_#in~index| dll_update_at_~index)) (.cse3 (= dll_update_at_~data |dll_update_at_#in~data|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse2 (+ |dll_update_at_#in~head.offset| 4))) (and (or .cse0 .cse1 (and (= (select (select |#memory_$Pointer$.offset| |dll_update_at_#in~head.base|) .cse2) dll_update_at_~head.offset) .cse3 .cse4) (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)))) (or .cse0 (and (= |dll_update_at_#in~head.base| dll_update_at_~head.base) (<= dll_update_at_~index |dll_update_at_#in~index|) .cse5 .cse1 .cse6 .cse3 .cse4 (= 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|) .cse2)) .cse5 .cse7 .cse6))))) [2019-10-02 10:57:56,726 INFO L443 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2019-10-02 10:57:56,726 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-02 10:57:56,726 INFO L443 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2019-10-02 10:57:56,727 INFO L443 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2019-10-02 10:57:56,727 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 10:57:56,727 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 10:57:56,727 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 10:57:56,727 INFO L446 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2019-10-02 10:57:56,727 INFO L443 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2019-10-02 10:57:56,727 INFO L446 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2019-10-02 10:57:56,727 INFO L443 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2019-10-02 10:57:56,727 INFO L439 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) 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-02 10:57:56,728 INFO L439 ceAbstractionStarter]: At program point L576-2(lines 576 589) the Hoare annotation is: (let ((.cse2 (= 0 dll_create_~head~0.offset)) (.cse0 (= 1 (select |#valid| dll_create_~new_head~0.base))) (.cse1 (= (select |#valid| dll_create_~head~0.base) 1)) (.cse3 (= 0 dll_create_~new_head~0.offset))) (or (and .cse0 .cse1 (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)) .cse2 .cse3) (and (<= |dll_create_#in~len| dll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) .cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 dll_create_~head~0.base)) (and .cse0 .cse1 (<= |dll_create_#in~len| (+ dll_create_~len 1)) .cse3))) [2019-10-02 10:57:56,728 INFO L443 ceAbstractionStarter]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2019-10-02 10:57:56,728 INFO L443 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2019-10-02 10:57:56,728 INFO L446 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2019-10-02 10:57:56,728 INFO L443 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2019-10-02 10:57:56,728 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2019-10-02 10:57:56,728 INFO L443 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2019-10-02 10:57:56,728 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2019-10-02 10:57:56,728 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2019-10-02 10:57:56,729 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2019-10-02 10:57:56,729 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2019-10-02 10:57:56,729 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2019-10-02 10:57:56,729 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2019-10-02 10:57:56,729 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2019-10-02 10:57:56,729 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 10:57:56,729 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 10:57:56,729 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 10:57:56,729 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 10:57:56,730 INFO L439 ceAbstractionStarter]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse2 (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 (or (= |dll_get_data_at_#in~index| dll_get_data_at_~index) (= 0 dll_get_data_at_~index)))) (and (let ((.cse0 (<= (+ dll_get_data_at_~index 1) |dll_get_data_at_#in~index|))) (or (and (or (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)) (not (= 0 |dll_get_data_at_#in~head.offset|))) .cse0) (and (<= |dll_get_data_at_#in~index| dll_get_data_at_~index) (= dll_get_data_at_~head.offset |dll_get_data_at_#in~head.offset|) .cse1 (= |dll_get_data_at_#in~head.base| dll_get_data_at_~head.base)) .cse2 (and (<= 2 |dll_get_data_at_#in~index|) .cse0))) (or .cse2 (<= 1 |dll_get_data_at_#in~index|) (and (<= dll_get_data_at_~index |dll_get_data_at_#in~index|) .cse1)))) [2019-10-02 10:57:56,730 INFO L443 ceAbstractionStarter]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2019-10-02 10:57:56,730 INFO L443 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2019-10-02 10:57:56,730 INFO L446 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2019-10-02 10:57:56,730 INFO L443 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2019-10-02 10:57:56,730 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2019-10-02 10:57:56,730 INFO L443 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2019-10-02 10:57:56,730 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)) (.cse8 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse11 (* 2 main_~len~0))) (let ((.cse4 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse0 (= main_~s~0.offset 0)) (.cse1 (<= .cse11 (+ main_~new_data~0 1))) (.cse2 (<= .cse11 (+ .cse8 1))) (.cse3 (<= main_~new_data~0 .cse10)) (.cse5 (<= .cse8 .cse10)) (.cse6 (not (= .cse9 main_~s~0.base))) (.cse7 (= main_~len~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 .cse4) .cse5 .cse6 .cse7 (= main_~i~0 0) (= main_~expected~0 .cse4)) (and (and (<= main_~expected~0 .cse8) (<= .cse8 main_~expected~0) (= main_~len~0 .cse4) .cse0 .cse1 .cse2 .cse3 .cse5 (<= 1 main_~i~0) .cse6 .cse7) (<= main_~i~0 1)))))) [2019-10-02 10:57:56,730 INFO L443 ceAbstractionStarter]: For program point L624-1(line 624) no Hoare annotation was computed. [2019-10-02 10:57:56,730 INFO L443 ceAbstractionStarter]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2019-10-02 10:57:56,731 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2019-10-02 10:57:56,731 INFO L439 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse1 (= main_~s~0.offset 0)) (.cse0 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) main_~s~0.base)))) (or (and (and (<= (+ main_~i~0 main_~len~0) main_~new_data~0) (<= main_~new_data~0 (+ main_~i~0 2)) .cse0 .cse1) (= main_~len~0 2) (= main_~i~0 0)) (and .cse1 (<= (* 2 main_~len~0) (+ main_~new_data~0 1)) (and (<= 1 main_~i~0) (<= (+ main_~i~0 1) main_~len~0) .cse0 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (<= main_~new_data~0 (+ main_~len~0 1))))) [2019-10-02 10:57:56,731 INFO L443 ceAbstractionStarter]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2019-10-02 10:57:56,731 INFO L443 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2019-10-02 10:57:56,731 INFO L439 ceAbstractionStarter]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~i~0) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= main_~s~0.offset 0) (= main_~len~0 2)))) (or (and .cse0 (<= 2 main_~i~0)) (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 .cse0 (<= .cse1 .cse2) (not (= .cse3 main_~s~0.base)) (<= .cse4 (+ main_~new_data~0 1)) (<= .cse4 (+ .cse1 1)) (<= main_~new_data~0 .cse2)))))) [2019-10-02 10:57:56,731 INFO L446 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: true [2019-10-02 10:57:56,731 INFO L439 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-02 10:57:56,732 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 ((.cse2 (<= 1 main_~i~0)) (.cse5 (not (= .cse8 main_~s~0.base))) (.cse3 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse4 (= main_~s~0.offset 0)) (.cse7 (= main_~len~0 2))) (or (let ((.cse6 (* 2 main_~len~0)) (.cse0 (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse1 (+ main_~len~0 1))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 (<= .cse6 (+ main_~new_data~0 1)) (<= .cse6 (+ .cse0 1)) (<= main_~new_data~0 .cse1) .cse7)) (and .cse5 .cse4 .cse7 (= main_~i~0 0)) (and .cse2 (<= main_~i~0 1) .cse5 .cse3 .cse4 .cse7)))) [2019-10-02 10:57:56,732 INFO L443 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2019-10-02 10:57:56,732 INFO L443 ceAbstractionStarter]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2019-10-02 10:57:56,732 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) 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-02 10:57:56,732 INFO L439 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2019-10-02 10:57:56,732 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2019-10-02 10:57:56,732 INFO L443 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2019-10-02 10:57:56,732 INFO L446 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2019-10-02 10:57:56,733 INFO L446 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2019-10-02 10:57:56,733 INFO L443 ceAbstractionStarter]: For program point L593-3(lines 592 598) no Hoare annotation was computed. [2019-10-02 10:57:56,733 INFO L443 ceAbstractionStarter]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2019-10-02 10:57:56,733 INFO L443 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2019-10-02 10:57:56,733 INFO L443 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2019-10-02 10:57:56,733 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2019-10-02 10:57:56,733 INFO L443 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2019-10-02 10:57:56,733 INFO L443 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2019-10-02 10:57:56,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,745 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,745 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,745 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,745 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,751 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,769 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,770 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,770 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,771 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,771 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,772 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,772 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,772 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,772 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,773 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,773 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,776 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,777 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,777 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,777 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,778 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,780 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,782 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,784 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,784 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,784 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,784 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,785 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,785 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,785 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,786 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,786 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,786 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,786 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,787 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,789 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,789 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,794 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,800 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,812 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,818 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,818 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,818 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,819 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,819 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,819 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,820 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,821 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,822 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,822 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,823 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,823 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,823 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,826 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,826 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,826 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,827 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,827 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 10:57:56 BoogieIcfgContainer [2019-10-02 10:57:56,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 10:57:56,838 INFO L168 Benchmark]: Toolchain (without parser) took 43495.54 ms. Allocated memory was 133.7 MB in the beginning and 458.8 MB in the end (delta: 325.1 MB). Free memory was 88.3 MB in the beginning and 363.2 MB in the end (delta: -274.9 MB). Peak memory consumption was 337.0 MB. Max. memory is 7.1 GB. [2019-10-02 10:57:56,838 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 10:57:56,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.49 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 88.1 MB in the beginning and 162.5 MB in the end (delta: -74.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-10-02 10:57:56,841 INFO L168 Benchmark]: Boogie Preprocessor took 66.22 ms. Allocated memory is still 201.9 MB. Free memory was 162.5 MB in the beginning and 160.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-02 10:57:56,841 INFO L168 Benchmark]: RCFGBuilder took 694.59 ms. Allocated memory is still 201.9 MB. Free memory was 159.5 MB in the beginning and 110.8 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-10-02 10:57:56,844 INFO L168 Benchmark]: TraceAbstraction took 42068.65 ms. Allocated memory was 201.9 MB in the beginning and 458.8 MB in the end (delta: 256.9 MB). Free memory was 110.8 MB in the beginning and 363.2 MB in the end (delta: -252.4 MB). Peak memory consumption was 291.3 MB. Max. memory is 7.1 GB. [2019-10-02 10:57:56,848 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.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 661.49 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 88.1 MB in the beginning and 162.5 MB in the end (delta: -74.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.22 ms. Allocated memory is still 201.9 MB. Free memory was 162.5 MB in the beginning and 160.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 694.59 ms. Allocated memory is still 201.9 MB. Free memory was 159.5 MB in the beginning and 110.8 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42068.65 ms. Allocated memory was 201.9 MB in the beginning and 458.8 MB in the end (delta: 256.9 MB). Free memory was 110.8 MB in the beginning and 363.2 MB in the end (delta: -252.4 MB). Peak memory consumption was 291.3 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$.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$.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$.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$.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$.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 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$.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 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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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_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_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_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_$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_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_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_$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_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_$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_$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_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 #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-02 10:57:56,868 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,869 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,870 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,870 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,874 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,874 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((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)) || (((((1 <= i && i <= 1) && !(#memory_$Pointer$[s][4] == s)) && len == unknown-#memory_int-unknown[s][s]) && s == 0) && len == 2) - InvariantResult [Line: 607]: Loop Invariant [2019-10-02 10:57:56,876 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,883 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,888 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,890 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || \old(index) <= index) || ((#memory_$Pointer$[head][head + 4] == head && data == \old(data)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (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))) && (((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 <= \old(index)) || (((((((head == head && index <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(index) <= index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 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$))) - InvariantResult [Line: 600]: Loop Invariant [2019-10-02 10:57:56,891 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,891 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,892 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:57:56,893 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((#memory_$Pointer$[head][4] == head && #memory_$Pointer$[head][4] == head) || !(0 == head)) && index + 1 <= \old(index)) || (((\old(index) <= index && head == head) && (\old(index) == index || 0 == index)) && head == head)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : int :: !(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][0] == 2))) || (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)) || 1 <= \old(index)) || (index <= \old(index) && (\old(index) == index || 0 == index))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 576]: Loop Invariant [2019-10-02 10:57:56,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,897 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((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) || (((((\old(len) <= len && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 0 == head)) || (((1 == \valid[new_head] && \valid[head] == 1) && \old(len) <= len + 1) && 0 == new_head) - InvariantResult [Line: 622]: Loop Invariant [2019-10-02 10:57:56,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:57:56,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:57:56,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:57:56,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:57:56,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((0 <= i && len == unknown-#memory_int-unknown[s][s]) && s == 0) && len == 2) && 2 <= i) || ((((((((0 <= i && 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) && !(#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. SAFE Result, 41.9s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 28.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 607 SDtfs, 576 SDslu, 2794 SDs, 0 SdLazy, 4671 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 805 GetRequests, 550 SyntacticMatches, 5 SemanticMatches, 250 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3965 ImplicationChecksByTransitivity, 28.9s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 144 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 78 PreInvPairs, 107 NumberOfFragments, 799 HoareAnnotationTreeSize, 78 FomulaSimplifications, 3971 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 2661 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1282 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1259 ConstructedInterpolants, 42 QuantifiedInterpolants, 350197 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 373/490 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...