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/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:53:18,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:53:18,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:53:18,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:53:18,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:53:18,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:53:18,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:53:18,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:53:18,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:53:18,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:53:18,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:53:18,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:53:18,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:53:18,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:53:18,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:53:18,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:53:18,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:53:18,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:53:18,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:53:18,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:53:18,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:53:18,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:53:18,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:53:18,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:53:18,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:53:18,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:53:18,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:53:18,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:53:18,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:53:18,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:53:18,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:53:18,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:53:18,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:53:18,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:53:18,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:53:18,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:53:18,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:53:18,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:53:18,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:53:18,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:53:18,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:53:18,776 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:53:18,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:53:18,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:53:18,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:53:18,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:53:18,801 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:53:18,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:53:18,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:53:18,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:53:18,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:53:18,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:53:18,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:53:18,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:53:18,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:53:18,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:53:18,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:53:18,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:53:18,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:53:18,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:53:18,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:53:18,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:53:18,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:53:18,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:53:18,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:53:18,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:53:18,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:53:18,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:53:18,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:53:18,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:53:18,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:53:18,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:53:18,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:53:18,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:53:18,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:53:18,858 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:53:18,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-10-02 10:53:18,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2dbede6/74bd755f45864a2e909eedda741fb354/FLAG3fbd3e859 [2019-10-02 10:53:19,537 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:53:19,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-10-02 10:53:19,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2dbede6/74bd755f45864a2e909eedda741fb354/FLAG3fbd3e859 [2019-10-02 10:53:19,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2dbede6/74bd755f45864a2e909eedda741fb354 [2019-10-02 10:53:19,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:53:19,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:53:19,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:53:19,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:53:19,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:53:19,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:53:19" (1/1) ... [2019-10-02 10:53:19,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f59e1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:19, skipping insertion in model container [2019-10-02 10:53:19,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:53:19" (1/1) ... [2019-10-02 10:53:19,787 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:53:19,844 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:53:20,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:53:20,311 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:53:20,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:53:20,423 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:53:20,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20 WrapperNode [2019-10-02 10:53:20,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:53:20,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:53:20,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:53:20,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:53:20,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (1/1) ... [2019-10-02 10:53:20,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (1/1) ... [2019-10-02 10:53:20,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (1/1) ... [2019-10-02 10:53:20,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (1/1) ... [2019-10-02 10:53:20,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (1/1) ... [2019-10-02 10:53:20,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (1/1) ... [2019-10-02 10:53:20,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (1/1) ... [2019-10-02 10:53:20,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:53:20,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:53:20,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:53:20,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:53:20,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (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:53:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:53:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:53:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:53:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:53:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 10:53:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-10-02 10:53:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-10-02 10:53:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-10-02 10:53:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-10-02 10:53:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-10-02 10:53:20,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:53:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:53:20,557 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:53:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:53:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:53:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:53:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:53:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:53:20,558 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:53:20,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:53:20,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:53:20,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:53:20,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:53:20,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:53:20,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:53:20,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:53:20,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:53:20,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:53:20,560 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:53:20,560 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:53:20,561 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:53:20,561 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:53:20,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:53:20,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:53:20,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:53:20,561 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:53:20,562 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:53:20,562 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:53:20,562 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:53:20,562 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:53:20,562 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:53:20,562 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:53:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:53:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:53:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:53:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:53:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:53:20,563 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:53:20,564 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:53:20,565 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:53:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:53:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:53:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:53:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:53:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:53:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:53:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:53:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:53:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 10:53:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:53:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:53:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:53:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 10:53:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:53:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:53:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 10:53:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:53:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:53:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 10:53:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:53:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:53:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:53:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:53:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:53:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:53:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:53:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:53:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:53:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:53:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:53:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:53:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:53:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:53:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:53:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:53:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:53:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:53:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:53:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:53:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:53:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:53:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:53:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:53:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:53:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:53:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:53:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:53:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:53:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:53:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:53:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:53:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:53:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:53:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:53:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 10:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-10-02 10:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:53:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-10-02 10:53:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-10-02 10:53:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:53:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:53:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-10-02 10:53:20,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:53:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-10-02 10:53:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:53:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:53:20,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:53:21,121 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 10:53:21,238 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:53:21,238 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-02 10:53:21,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:53:21 BoogieIcfgContainer [2019-10-02 10:53:21,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:53:21,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:53:21,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:53:21,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:53:21,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:53:19" (1/3) ... [2019-10-02 10:53:21,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288b413d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:53:21, skipping insertion in model container [2019-10-02 10:53:21,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:53:20" (2/3) ... [2019-10-02 10:53:21,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288b413d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:53:21, skipping insertion in model container [2019-10-02 10:53:21,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:53:21" (3/3) ... [2019-10-02 10:53:21,254 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2019-10-02 10:53:21,266 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:53:21,278 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:53:21,297 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:53:21,323 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:53:21,324 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:53:21,324 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:53:21,324 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:53:21,325 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:53:21,325 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:53:21,325 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:53:21,325 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:53:21,325 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:53:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-10-02 10:53:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 10:53:21,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:21,356 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, 1, 1] [2019-10-02 10:53:21,358 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-10-02 10:53:21,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:21,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:21,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:21,562 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:53:21,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:53:21,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:53:21,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:53:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:53:21,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:53:21,589 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2019-10-02 10:53:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:21,624 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2019-10-02 10:53:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:53:21,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-02 10:53:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:21,638 INFO L225 Difference]: With dead ends: 97 [2019-10-02 10:53:21,639 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 10:53:21,644 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:53:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 10:53:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-02 10:53:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 10:53:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-10-02 10:53:21,703 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-10-02 10:53:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:21,705 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-10-02 10:53:21,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:53:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-10-02 10:53:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 10:53:21,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:21,709 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, 1, 1] [2019-10-02 10:53:21,710 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:21,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-10-02 10:53:21,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:21,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:21,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:21,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:21,917 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:53:21,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:53:21,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 10:53:21,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:53:21,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:53:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:53:21,951 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2019-10-02 10:53:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:22,025 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2019-10-02 10:53:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:53:22,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-02 10:53:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:22,028 INFO L225 Difference]: With dead ends: 75 [2019-10-02 10:53:22,028 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 10:53:22,029 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:53:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 10:53:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-10-02 10:53:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 10:53:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-02 10:53:22,040 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-10-02 10:53:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:22,041 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-02 10:53:22,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:53:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-02 10:53:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 10:53:22,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:22,043 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] [2019-10-02 10:53:22,043 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:22,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash -820838434, now seen corresponding path program 1 times [2019-10-02 10:53:22,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:22,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:22,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:22,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:22,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 10:53:22,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:53:22,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:53:22,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:53:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:53:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:53:22,196 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2019-10-02 10:53:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:22,256 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-10-02 10:53:22,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:53:22,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-02 10:53:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:22,259 INFO L225 Difference]: With dead ends: 69 [2019-10-02 10:53:22,259 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 10:53:22,260 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:53:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 10:53:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-10-02 10:53:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 10:53:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-10-02 10:53:22,269 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2019-10-02 10:53:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:22,270 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-10-02 10:53:22,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:53:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-10-02 10:53:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 10:53:22,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:22,272 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:22,272 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-10-02 10:53:22,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:22,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 10:53:22,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:22,388 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:53:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:22,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:53:22,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 10:53:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:53:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-10-02 10:53:22,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:53:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:53:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:53:22,685 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2019-10-02 10:53:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:22,807 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-10-02 10:53:22,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:53:22,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-02 10:53:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:22,810 INFO L225 Difference]: With dead ends: 79 [2019-10-02 10:53:22,810 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 10:53:22,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 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:53:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 10:53:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-10-02 10:53:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-02 10:53:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-10-02 10:53:22,821 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 50 [2019-10-02 10:53:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:22,821 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-10-02 10:53:22,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:53:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-10-02 10:53:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 10:53:22,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:22,823 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, 1, 1, 1, 1, 1] [2019-10-02 10:53:22,824 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:22,824 INFO L82 PathProgramCache]: Analyzing trace with hash -470871118, now seen corresponding path program 2 times [2019-10-02 10:53:22,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:22,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:22,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:22,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:53:22,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:22,938 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:53:23,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:53:23,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:53:23,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:53:23,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:53:23,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:53:23,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:53:23,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-10-02 10:53:23,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 10:53:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 10:53:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:53:23,367 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 9 states. [2019-10-02 10:53:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:23,547 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-10-02 10:53:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 10:53:23,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 10:53:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:23,550 INFO L225 Difference]: With dead ends: 83 [2019-10-02 10:53:23,551 INFO L226 Difference]: Without dead ends: 62 [2019-10-02 10:53:23,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-02 10:53:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-02 10:53:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-10-02 10:53:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 10:53:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-10-02 10:53:23,561 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 58 [2019-10-02 10:53:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:23,562 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-10-02 10:53:23,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 10:53:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-10-02 10:53:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 10:53:23,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:23,564 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, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:23,564 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1967505627, now seen corresponding path program 1 times [2019-10-02 10:53:23,564 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:23,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:23,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:53:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:53:25,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:25,074 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:53:25,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:25,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-02 10:53:25,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:25,288 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:53:25,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:25,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:25,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:25,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-02 10:53:25,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:25,476 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:53:25,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:25,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:25,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:25,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-02 10:53:25,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:53:25,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:25,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:25,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:25,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 10:53:25,608 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 21 treesize of output 20 [2019-10-02 10:53:25,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:25,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:25,621 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:53:25,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-10-02 10:53:25,956 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-02 10:53:25,957 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-10-02 10:53:25,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-10-02 10:53:25,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:26,005 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-10-02 10:53:26,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:53:26,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-10-02 10:53:26,458 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 13 treesize of output 9 [2019-10-02 10:53:26,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:26,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:26,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:26,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-02 10:53:26,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:26,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:26,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:26,602 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-10-02 10:53:26,603 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 58 treesize of output 81 [2019-10-02 10:53:26,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:26,635 INFO L567 ElimStorePlain]: treesize reduction 72, result has 41.5 percent of original size [2019-10-02 10:53:26,637 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:53:26,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:51 [2019-10-02 10:53:27,566 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2019-10-02 10:53:27,575 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_int)_AFTER_CALL_14|], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_14|]} [2019-10-02 10:53:27,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:27,582 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 26 [2019-10-02 10:53:27,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:27,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:27,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:27,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:27,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2019-10-02 10:53:27,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:27,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:27,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:27,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:27,632 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:53:27,668 INFO L567 ElimStorePlain]: treesize reduction 30, result has 46.4 percent of original size [2019-10-02 10:53:27,669 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:53:27,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:13 [2019-10-02 10:53:28,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:28,710 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 37 treesize of output 29 [2019-10-02 10:53:28,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:28,759 INFO L567 ElimStorePlain]: treesize reduction 16, result has 30.4 percent of original size [2019-10-02 10:53:28,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:28,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:7 [2019-10-02 10:53:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:53:28,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:53:28,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 59 [2019-10-02 10:53:28,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 10:53:28,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 10:53:28,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3143, Unknown=2, NotChecked=112, Total=3422 [2019-10-02 10:53:28,844 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 59 states. [2019-10-02 10:53:34,827 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2019-10-02 10:53:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:42,578 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2019-10-02 10:53:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 10:53:42,578 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-10-02 10:53:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:42,584 INFO L225 Difference]: With dead ends: 121 [2019-10-02 10:53:42,584 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 10:53:42,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1721 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=497, Invalid=8238, Unknown=11, NotChecked=184, Total=8930 [2019-10-02 10:53:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 10:53:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2019-10-02 10:53:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-02 10:53:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2019-10-02 10:53:42,608 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 59 [2019-10-02 10:53:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:42,609 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2019-10-02 10:53:42,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 10:53:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2019-10-02 10:53:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 10:53:42,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:42,611 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:42,612 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:42,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:42,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1479492828, now seen corresponding path program 1 times [2019-10-02 10:53:42,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:42,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:42,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 10:53:42,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:42,680 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:53:42,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:42,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:53:42,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 10:53:42,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:53:42,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 10:53:42,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:53:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:53:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:53:42,880 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand 8 states. [2019-10-02 10:53:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:42,967 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2019-10-02 10:53:42,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:53:42,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-10-02 10:53:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:42,970 INFO L225 Difference]: With dead ends: 131 [2019-10-02 10:53:42,970 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 10:53:42,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 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:53:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 10:53:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2019-10-02 10:53:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 10:53:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2019-10-02 10:53:42,990 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 60 [2019-10-02 10:53:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:42,991 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2019-10-02 10:53:42,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:53:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2019-10-02 10:53:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 10:53:42,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:42,993 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:42,993 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:42,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1118535150, now seen corresponding path program 2 times [2019-10-02 10:53:42,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:42,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:42,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:53:43,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:43,072 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:53:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:53:43,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:53:43,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:53:43,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 10:53:43,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:53:43,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:53:43,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 10:53:43,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:53:43,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:53:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:53:43,430 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand 8 states. [2019-10-02 10:53:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:43,558 INFO L93 Difference]: Finished difference Result 144 states and 175 transitions. [2019-10-02 10:53:43,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 10:53:43,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-10-02 10:53:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:43,560 INFO L225 Difference]: With dead ends: 144 [2019-10-02 10:53:43,560 INFO L226 Difference]: Without dead ends: 103 [2019-10-02 10:53:43,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 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:53:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-02 10:53:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2019-10-02 10:53:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 10:53:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-10-02 10:53:43,579 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 60 [2019-10-02 10:53:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:43,580 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-10-02 10:53:43,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:53:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-10-02 10:53:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 10:53:43,582 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:43,582 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:43,582 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1221148414, now seen corresponding path program 3 times [2019-10-02 10:53:43,583 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:43,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:43,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:43,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:53:43,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 10:53:43,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:43,683 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:53:43,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:53:44,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:53:44,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:53:44,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:53:44,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:53:44,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:53:44,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 10:53:44,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:53:44,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:53:44,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:53:44,317 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 8 states. [2019-10-02 10:53:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:44,398 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2019-10-02 10:53:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:53:44,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-10-02 10:53:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:44,400 INFO L225 Difference]: With dead ends: 134 [2019-10-02 10:53:44,400 INFO L226 Difference]: Without dead ends: 101 [2019-10-02 10:53:44,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 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:53:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-02 10:53:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2019-10-02 10:53:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 10:53:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-10-02 10:53:44,422 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 60 [2019-10-02 10:53:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:44,423 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-10-02 10:53:44,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:53:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-10-02 10:53:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 10:53:44,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:44,430 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:44,430 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2045941912, now seen corresponding path program 4 times [2019-10-02 10:53:44,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:44,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:44,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:44,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:53:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 10:53:44,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:44,518 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:53:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:53:44,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:53:44,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:53:44,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:53:44,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 10:53:44,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:53:44,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2019-10-02 10:53:44,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 10:53:44,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 10:53:44,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 10:53:44,727 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 10 states. [2019-10-02 10:53:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:44,843 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-10-02 10:53:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 10:53:44,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-10-02 10:53:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:44,847 INFO L225 Difference]: With dead ends: 153 [2019-10-02 10:53:44,847 INFO L226 Difference]: Without dead ends: 101 [2019-10-02 10:53:44,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 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:53:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-02 10:53:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-10-02 10:53:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-02 10:53:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-10-02 10:53:44,875 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 68 [2019-10-02 10:53:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:44,876 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-10-02 10:53:44,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 10:53:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-10-02 10:53:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 10:53:44,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:44,879 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, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:44,879 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 715119440, now seen corresponding path program 1 times [2019-10-02 10:53:44,880 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:44,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:44,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:53:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 10:53:45,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:45,001 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:53:45,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:45,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:53:45,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 10:53:45,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:53:45,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2019-10-02 10:53:45,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:53:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:53:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:53:45,170 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 7 states. [2019-10-02 10:53:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:45,258 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2019-10-02 10:53:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:53:45,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-10-02 10:53:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:45,260 INFO L225 Difference]: With dead ends: 115 [2019-10-02 10:53:45,260 INFO L226 Difference]: Without dead ends: 103 [2019-10-02 10:53:45,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 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:53:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-02 10:53:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-10-02 10:53:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-02 10:53:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2019-10-02 10:53:45,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 69 [2019-10-02 10:53:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:45,284 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2019-10-02 10:53:45,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:53:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2019-10-02 10:53:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 10:53:45,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:45,286 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:45,286 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2055631537, now seen corresponding path program 5 times [2019-10-02 10:53:45,287 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:45,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:45,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:45,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:45,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 10:53:45,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:45,390 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:53:45,484 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 10:53:45,684 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-10-02 10:53:45,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:53:45,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:53:45,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 10:53:45,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:53:45,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-10-02 10:53:45,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:53:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:53:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:53:45,728 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 6 states. [2019-10-02 10:53:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:53:45,809 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2019-10-02 10:53:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:53:45,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-10-02 10:53:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:53:45,810 INFO L225 Difference]: With dead ends: 116 [2019-10-02 10:53:45,811 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 10:53:45,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:53:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 10:53:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-02 10:53:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 10:53:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-02 10:53:45,819 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 69 [2019-10-02 10:53:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:53:45,819 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-02 10:53:45,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:53:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-02 10:53:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 10:53:45,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:53:45,821 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:53:45,821 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:53:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:53:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1258476015, now seen corresponding path program 1 times [2019-10-02 10:53:45,821 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:53:45,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:53:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:45,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:53:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:53:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:53:47,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:53:47,192 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:53:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:53:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:53:47,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-02 10:53:47,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:53:47,385 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:53:47,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:47,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:47,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:47,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-02 10:53:47,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:47,638 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:53:47,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:47,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:47,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:47,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-02 10:53:47,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:53:47,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:47,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:47,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:47,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 10:53:47,800 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 21 treesize of output 20 [2019-10-02 10:53:47,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:47,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:47,807 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:53:47,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-10-02 10:53:48,067 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-02 10:53:48,067 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-10-02 10:53:48,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-10-02 10:53:48,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:48,109 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-10-02 10:53:48,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:53:48,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-10-02 10:53:48,525 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 19 treesize of output 1 [2019-10-02 10:53:48,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:48,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:48,533 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:53:48,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-02 10:53:49,166 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-10-02 10:53:49,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:49,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:49,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:49,257 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-10-02 10:53:49,257 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 58 treesize of output 81 [2019-10-02 10:53:49,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:49,290 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.0 percent of original size [2019-10-02 10:53:49,291 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:53:49,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:45 [2019-10-02 10:53:49,587 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 25 treesize of output 17 [2019-10-02 10:53:49,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:49,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:49,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:49,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2019-10-02 10:53:49,715 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_51|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-10-02 10:53:49,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:49,721 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 117 treesize of output 95 [2019-10-02 10:53:49,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:49,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:49,923 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-02 10:53:49,923 INFO L341 Elim1Store]: treesize reduction 10, result has 95.4 percent of original size [2019-10-02 10:53:49,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 275 [2019-10-02 10:53:49,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:49,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:49,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:53:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:49,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:49,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-02 10:53:50,054 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-10-02 10:53:50,055 INFO L567 ElimStorePlain]: treesize reduction 604, result has 12.8 percent of original size [2019-10-02 10:53:50,056 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:53:50,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:63 [2019-10-02 10:53:51,216 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|, |#memory_int|], 12=[|#memory_$Pointer$.base|]} [2019-10-02 10:53:51,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:51,230 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 86 treesize of output 78 [2019-10-02 10:53:51,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:51,234 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:53:51,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:51,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:51,293 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 66 treesize of output 40 [2019-10-02 10:53:51,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:51,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:51,352 INFO L567 ElimStorePlain]: treesize reduction 28, result has 69.6 percent of original size [2019-10-02 10:53:51,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:51,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:53:51,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:51,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 71 [2019-10-02 10:53:51,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:51,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:51,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:51,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:53:51,412 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:53:51,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:53:51,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:53:51,428 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:131, output treesize:10 [2019-10-02 10:53:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-10-02 10:53:51,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:53:51,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 64 [2019-10-02 10:53:51,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-02 10:53:51,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-02 10:53:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3725, Unknown=1, NotChecked=122, Total=4032 [2019-10-02 10:53:51,527 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 64 states. [2019-10-02 10:54:00,080 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-10-02 10:54:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:54:05,896 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-10-02 10:54:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 10:54:05,897 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 70 [2019-10-02 10:54:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:54:05,898 INFO L225 Difference]: With dead ends: 116 [2019-10-02 10:54:05,898 INFO L226 Difference]: Without dead ends: 104 [2019-10-02 10:54:05,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=560, Invalid=9949, Unknown=1, NotChecked=202, Total=10712 [2019-10-02 10:54:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-02 10:54:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 67. [2019-10-02 10:54:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 10:54:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-02 10:54:05,911 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 70 [2019-10-02 10:54:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:54:05,912 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-02 10:54:05,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-02 10:54:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-02 10:54:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 10:54:05,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:54:05,913 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:54:05,914 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:54:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:54:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1984574320, now seen corresponding path program 2 times [2019-10-02 10:54:05,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:54:05,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:54:05,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:54:05,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:54:05,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:54:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:54:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 10:54:06,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:54:06,031 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:54:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:54:06,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:54:06,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:54:06,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 10:54:06,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:54:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:54:06,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:54:06,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 10:54:06,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:54:06,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:54:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:54:06,353 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 7 states. [2019-10-02 10:54:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:54:06,440 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-10-02 10:54:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:54:06,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-02 10:54:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:54:06,441 INFO L225 Difference]: With dead ends: 67 [2019-10-02 10:54:06,441 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 10:54:06,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 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:54:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 10:54:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 10:54:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 10:54:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 10:54:06,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2019-10-02 10:54:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:54:06,444 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 10:54:06,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:54:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 10:54:06,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 10:54:06,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 10:54:06,964 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2019-10-02 10:54:07,198 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-10-02 10:54:07,458 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 39 [2019-10-02 10:54:07,652 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-10-02 10:54:07,793 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-10-02 10:54:08,038 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-10-02 10:54:08,171 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2019-10-02 10:54:08,176 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 10:54:08,176 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2019-10-02 10:54:08,176 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 10:54:08,176 INFO L446 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2019-10-02 10:54:08,176 INFO L443 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2019-10-02 10:54:08,177 INFO L446 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2019-10-02 10:54:08,177 INFO L446 ceAbstractionStarter]: At program point dll_circular_destroyENTRY(lines 590 600) the Hoare annotation is: true [2019-10-02 10:54:08,177 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 599) no Hoare annotation was computed. [2019-10-02 10:54:08,177 INFO L446 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2019-10-02 10:54:08,177 INFO L443 ceAbstractionStarter]: For program point L593-3(lines 593 597) no Hoare annotation was computed. [2019-10-02 10:54:08,177 INFO L443 ceAbstractionStarter]: For program point L591-2(lines 590 600) no Hoare annotation was computed. [2019-10-02 10:54:08,177 INFO L443 ceAbstractionStarter]: For program point dll_circular_destroyEXIT(lines 590 600) no Hoare annotation was computed. [2019-10-02 10:54:08,177 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2019-10-02 10:54:08,177 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2019-10-02 10:54:08,177 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2019-10-02 10:54:08,178 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2019-10-02 10:54:08,178 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2019-10-02 10:54:08,178 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2019-10-02 10:54:08,178 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 10:54:08,178 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 10:54:08,178 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 10:54:08,178 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 10:54:08,178 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 615 634) no Hoare annotation was computed. [2019-10-02 10:54:08,179 INFO L443 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2019-10-02 10:54:08,179 INFO L439 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 8))) (.cse3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) 8)) (.cse11 (+ main_~len~0 1)) (.cse10 (* 2 main_~len~0))) (let ((.cse0 (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (.cse1 (= main_~s~0.offset 0)) (.cse2 (<= .cse10 (+ main_~new_data~0 1))) (.cse4 (<= .cse3 .cse11)) (.cse5 (<= main_~new_data~0 .cse11)) (.cse6 (<= .cse10 (+ .cse3 1))) (.cse7 (= main_~len~0 .cse9)) (.cse8 (= main_~len~0 2))) (or (and .cse0 .cse1 .cse2 (<= main_~expected~0 .cse3) .cse4 .cse5 (<= .cse3 main_~expected~0) (<= 1 main_~i~0) .cse6 (<= main_~i~0 1) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (= .cse9 main_~expected~0) .cse7 .cse8 (= main_~i~0 0))))) [2019-10-02 10:54:08,179 INFO L443 ceAbstractionStarter]: For program point L626-1(line 626) no Hoare annotation was computed. [2019-10-02 10:54:08,179 INFO L443 ceAbstractionStarter]: For program point L626-2(lines 626 628) no Hoare annotation was computed. [2019-10-02 10:54:08,179 INFO L439 ceAbstractionStarter]: At program point L622(line 622) the Hoare annotation is: (let ((.cse0 (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (.cse1 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset) main_~s~0.base))) (.cse2 (= main_~s~0.offset 0)) (.cse3 (= main_~len~0 2))) (or (and .cse0 .cse1 .cse2 (and (<= (+ main_~i~0 main_~len~0) main_~new_data~0) (<= main_~new_data~0 (+ main_~i~0 2))) .cse3 (= main_~i~0 0)) (and .cse0 (let ((.cse4 (select |#memory_int| main_~s~0.base))) (and .cse1 .cse2 (= main_~len~0 (select .cse4 (+ main_~s~0.offset 8))) (<= (select .cse4 8) (+ main_~i~0 1)))) (<= main_~i~0 1) (<= (* 2 main_~len~0) (+ main_~new_data~0 1)) .cse3 (<= main_~new_data~0 (+ main_~len~0 1))))) [2019-10-02 10:54:08,179 INFO L443 ceAbstractionStarter]: For program point L624-2(lines 624 629) no Hoare annotation was computed. [2019-10-02 10:54:08,179 INFO L443 ceAbstractionStarter]: For program point L622-1(lines 620 623) no Hoare annotation was computed. [2019-10-02 10:54:08,179 INFO L439 ceAbstractionStarter]: At program point L624-3(lines 624 629) the Hoare annotation is: (let ((.cse0 (= main_~len~0 2))) (or (and (<= 2 main_~i~0) .cse0) (let ((.cse1 (* 2 main_~len~0)) (.cse2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) 8)) (.cse3 (+ main_~len~0 1))) (and (and (<= 0 main_~i~0) (= main_~s~0.offset 0) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 8))) .cse0) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (<= .cse1 (+ .cse2 1)) (<= .cse1 (+ main_~new_data~0 1)) (<= .cse2 .cse3) (<= main_~new_data~0 .cse3))))) [2019-10-02 10:54:08,179 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 615 634) no Hoare annotation was computed. [2019-10-02 10:54:08,180 INFO L446 ceAbstractionStarter]: At program point L624-4(lines 624 629) the Hoare annotation is: true [2019-10-02 10:54:08,180 INFO L439 ceAbstractionStarter]: At program point L618(line 618) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#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:54:08,180 INFO L439 ceAbstractionStarter]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (.cse5 (select |#memory_int| main_~s~0.base))) (let ((.cse3 (= main_~len~0 (select .cse5 (+ main_~s~0.offset 8)))) (.cse0 (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (.cse1 (not (= .cse9 main_~s~0.base))) (.cse2 (= main_~s~0.offset 0)) (.cse4 (= main_~len~0 2))) (or (and .cse0 .cse1 (<= main_~i~0 1) .cse2 .cse3 .cse4 (<= (select .cse5 8) (+ main_~i~0 1))) (let ((.cse8 (+ main_~len~0 1)) (.cse6 (* 2 main_~len~0)) (.cse7 (select (select |#memory_int| .cse9) 8))) (and .cse0 .cse2 (<= .cse6 (+ main_~new_data~0 1)) (<= .cse7 .cse8) (<= main_~new_data~0 .cse8) (<= 1 main_~i~0) (<= .cse6 (+ .cse7 1)) .cse3 .cse4)) (and .cse0 .cse1 .cse2 .cse4 (= main_~i~0 0))))) [2019-10-02 10:54:08,180 INFO L443 ceAbstractionStarter]: For program point L618-1(line 618) no Hoare annotation was computed. [2019-10-02 10:54:08,180 INFO L443 ceAbstractionStarter]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2019-10-02 10:54:08,180 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 615 634) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-02 10:54:08,180 INFO L439 ceAbstractionStarter]: At program point L627(lines 615 634) the Hoare annotation is: false [2019-10-02 10:54:08,180 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 632) no Hoare annotation was computed. [2019-10-02 10:54:08,181 INFO L443 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2019-10-02 10:54:08,181 INFO L439 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (and (<= |dll_circular_create_#in~len| dll_circular_create_~len) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= dll_circular_create_~len |dll_circular_create_#in~len|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-02 10:54:08,181 INFO L439 ceAbstractionStarter]: At program point L577-2(lines 577 585) the Hoare annotation is: (let ((.cse0 (<= (+ dll_circular_create_~len 1) |dll_circular_create_#in~len|)) (.cse1 (= 0 dll_circular_create_~head~0.offset))) (or (and .cse0 (<= 3 |dll_circular_create_#in~len|)) (and (<= |dll_circular_create_#in~len| dll_circular_create_~len) .cse1 (= 1 (select |#valid| dll_circular_create_~last~0.base)) (<= dll_circular_create_~len |dll_circular_create_#in~len|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (let ((.cse2 (+ dll_circular_create_~head~0.offset 4))) (and (= 0 (select (select |#memory_$Pointer$.offset| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) .cse0 (= 0 (select (store (select (store |#memory_$Pointer$.offset| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.offset)) dll_circular_create_~head~0.base) .cse2 dll_circular_create_~last~0.offset) dll_circular_create_~head~0.offset)) .cse1 (not (= dll_circular_create_~new_head~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset))) (= 0 dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~head~0.base (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) .cse2 dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset))) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))))) [2019-10-02 10:54:08,181 INFO L443 ceAbstractionStarter]: For program point dll_circular_createEXIT(lines 574 589) no Hoare annotation was computed. [2019-10-02 10:54:08,181 INFO L443 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2019-10-02 10:54:08,181 INFO L443 ceAbstractionStarter]: For program point L577-3(lines 577 585) no Hoare annotation was computed. [2019-10-02 10:54:08,182 INFO L443 ceAbstractionStarter]: For program point dll_circular_createFINAL(lines 574 589) no Hoare annotation was computed. [2019-10-02 10:54:08,182 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2019-10-02 10:54:08,182 INFO L439 ceAbstractionStarter]: At program point dll_circular_createENTRY(lines 574 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-02 10:54:08,182 INFO L439 ceAbstractionStarter]: At program point L578(line 578) the Hoare annotation is: (or (and (<= (+ dll_circular_create_~len 1) |dll_circular_create_#in~len|) (<= 3 |dll_circular_create_#in~len|)) (and (= 0 dll_circular_create_~head~0.offset) (= 1 (select |#valid| dll_circular_create_~last~0.base)) (<= dll_circular_create_~len |dll_circular_create_#in~len|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))) [2019-10-02 10:54:08,182 INFO L443 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2019-10-02 10:54:08,182 INFO L439 ceAbstractionStarter]: At program point L609-2(lines 609 612) the Hoare annotation is: (let ((.cse3 (<= (+ dll_circular_update_at_~index 1) |dll_circular_update_at_#in~index|)) (.cse4 (= |#memory_int| |old(#memory_int)|)) (.cse5 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (let ((.cse2 (and .cse3 (<= 2 |dll_circular_update_at_#in~index|) .cse4 .cse5)) (.cse0 (<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)) (.cse1 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (and (or .cse0 (and (<= dll_circular_update_at_~data |dll_circular_update_at_#in~data|) (= (select (select |#memory_$Pointer$.offset| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset) .cse1 (<= |dll_circular_update_at_#in~data| dll_circular_update_at_~data)) .cse2) (or .cse2 (and .cse3 (= (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.base) (<= 1 |dll_circular_update_at_#in~index|) .cse4 .cse5) (and (= dll_circular_update_at_~head.base |dll_circular_update_at_#in~head.base|) (<= dll_circular_update_at_~index |dll_circular_update_at_#in~index|) .cse4 (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data) .cse5 .cse0 .cse1 (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))))) [2019-10-02 10:54:08,183 INFO L443 ceAbstractionStarter]: For program point L609-3(lines 609 612) no Hoare annotation was computed. [2019-10-02 10:54:08,183 INFO L443 ceAbstractionStarter]: For program point dll_circular_update_atFINAL(lines 608 614) no Hoare annotation was computed. [2019-10-02 10:54:08,183 INFO L443 ceAbstractionStarter]: For program point dll_circular_update_atEXIT(lines 608 614) no Hoare annotation was computed. [2019-10-02 10:54:08,183 INFO L439 ceAbstractionStarter]: At program point dll_circular_update_atENTRY(lines 608 614) 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:54:08,183 INFO L439 ceAbstractionStarter]: At program point node_createENTRY(lines 564 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-02 10:54:08,183 INFO L443 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2019-10-02 10:54:08,183 INFO L446 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2019-10-02 10:54:08,183 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2019-10-02 10:54:08,184 INFO L443 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2019-10-02 10:54:08,184 INFO L443 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2019-10-02 10:54:08,184 INFO L443 ceAbstractionStarter]: For program point dll_circular_get_data_atFINAL(lines 601 607) no Hoare annotation was computed. [2019-10-02 10:54:08,184 INFO L443 ceAbstractionStarter]: For program point dll_circular_get_data_atEXIT(lines 601 607) no Hoare annotation was computed. [2019-10-02 10:54:08,184 INFO L446 ceAbstractionStarter]: At program point dll_circular_get_data_atENTRY(lines 601 607) the Hoare annotation is: true [2019-10-02 10:54:08,184 INFO L439 ceAbstractionStarter]: At program point L602-2(lines 602 605) the Hoare annotation is: (let ((.cse0 (<= (+ dll_circular_get_data_at_~index 1) |dll_circular_get_data_at_#in~index|))) (or (and (<= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index) (<= dll_circular_get_data_at_~index |dll_circular_get_data_at_#in~index|) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|)) (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (not (= 2 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (+ v_main_~s~0.offset_BEFORE_CALL_3 8))))) (and (<= 2 |dll_circular_get_data_at_#in~index|) .cse0) (and (<= 1 |dll_circular_get_data_at_#in~index|) (or (= dll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|)) (= dll_circular_get_data_at_~head.offset 0)) .cse0 (= (select (select |#memory_$Pointer$.base| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|) dll_circular_get_data_at_~head.base)))) [2019-10-02 10:54:08,184 INFO L443 ceAbstractionStarter]: For program point L602-3(lines 602 605) no Hoare annotation was computed. [2019-10-02 10:54:08,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,210 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,210 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,210 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,222 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,230 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:54:08,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:54:08,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,232 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:54:08,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:54:08,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,239 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,239 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,246 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 10:54:08 BoogieIcfgContainer [2019-10-02 10:54:08,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 10:54:08,253 INFO L168 Benchmark]: Toolchain (without parser) took 48484.43 ms. Allocated memory was 132.1 MB in the beginning and 519.6 MB in the end (delta: 387.4 MB). Free memory was 86.5 MB in the beginning and 145.8 MB in the end (delta: -59.2 MB). Peak memory consumption was 328.2 MB. Max. memory is 7.1 GB. [2019-10-02 10:54:08,253 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 132.1 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 10:54:08,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.05 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 86.5 MB in the beginning and 161.0 MB in the end (delta: -74.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-10-02 10:54:08,255 INFO L168 Benchmark]: Boogie Preprocessor took 67.06 ms. Allocated memory is still 200.3 MB. Free memory was 161.0 MB in the beginning and 157.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-10-02 10:54:08,255 INFO L168 Benchmark]: RCFGBuilder took 747.78 ms. Allocated memory is still 200.3 MB. Free memory was 157.8 MB in the beginning and 108.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-10-02 10:54:08,256 INFO L168 Benchmark]: TraceAbstraction took 47009.53 ms. Allocated memory was 200.3 MB in the beginning and 519.6 MB in the end (delta: 319.3 MB). Free memory was 107.6 MB in the beginning and 145.8 MB in the end (delta: -38.2 MB). Peak memory consumption was 281.1 MB. Max. memory is 7.1 GB. [2019-10-02 10:54:08,259 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 132.1 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 655.05 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 86.5 MB in the beginning and 161.0 MB in the end (delta: -74.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.06 ms. Allocated memory is still 200.3 MB. Free memory was 161.0 MB in the beginning and 157.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 747.78 ms. Allocated memory is still 200.3 MB. Free memory was 157.8 MB in the beginning and 108.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47009.53 ms. Allocated memory was 200.3 MB in the beginning and 519.6 MB in the end (delta: 319.3 MB). Free memory was 107.6 MB in the beginning and 145.8 MB in the end (delta: -38.2 MB). Peak memory consumption was 281.1 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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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 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$.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 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.offset_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.offset_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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_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_$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_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_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_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_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_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_$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_$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_$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_$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_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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 632]: 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: 609]: Loop Invariant [2019-10-02 10:54:08,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((\old(index) <= index || (((data <= \old(data) && #memory_$Pointer$[head][head] == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data)) || (((index + 1 <= \old(index) && 2 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && (((((index + 1 <= \old(index) && 2 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((((index + 1 <= \old(index) && #memory_$Pointer$[head][head] == head) && 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || (((((((head == head && index <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \old(data) == data) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(index) <= index) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant [2019-10-02 10:54:08,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,291 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,292 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,293 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,293 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,293 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((0 == #memory_$Pointer$[s][s] && !(#memory_$Pointer$[s][s] == s)) && i <= 1) && s == 0) && len == unknown-#memory_int-unknown[s][s + 8]) && len == 2) && unknown-#memory_int-unknown[s][8] <= i + 1) || ((((((((0 == #memory_$Pointer$[s][s] && s == 0) && 2 * len <= new_data + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && new_data <= len + 1) && 1 <= i) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && len == unknown-#memory_int-unknown[s][s + 8]) && len == 2)) || ((((0 == #memory_$Pointer$[s][s] && !(#memory_$Pointer$[s][s] == s)) && s == 0) && len == 2) && i == 0) - InvariantResult [Line: 602]: Loop Invariant [2019-10-02 10:54:08,298 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:54:08,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:54:08,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,300 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:54:08,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2019-10-02 10:54:08,300 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((\old(index) <= index && index <= \old(index)) && head == head) && head == head) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: !(2 == unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8]))) || (2 <= \old(index) && index + 1 <= \old(index))) || (((1 <= \old(index) && (head == #memory_$Pointer$[head][head] || head == 0)) && index + 1 <= \old(index)) && #memory_$Pointer$[head][head] == head) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant [2019-10-02 10:54:08,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((len + 1 <= \old(len) && 3 <= \old(len)) || ((((\old(len) <= len && 0 == head) && 1 == \valid[last]) && len <= \old(len)) && head == last)) || (((((((0 == #memory_$Pointer$[new_head][new_head] && len + 1 <= \old(len)) && 0 == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head]) && 0 == head) && !(new_head == #memory_$Pointer$[new_head][new_head])) && 0 == new_head) && !(head == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head])) && !(new_head == last)) - InvariantResult [Line: 624]: Loop Invariant [2019-10-02 10:54:08,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-02 10:54:08,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-02 10:54:08,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-02 10:54:08,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 10:54:08,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (2 <= i && len == 2) || ((((((((0 <= i && s == 0) && len == unknown-#memory_int-unknown[s][s + 8]) && len == 2) && 0 == #memory_$Pointer$[s][s]) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] + 1) && 2 * len <= new_data + 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][8] <= len + 1) && new_data <= len + 1) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 67 locations, 1 error locations. SAFE Result, 46.8s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 675 SDtfs, 663 SDslu, 3216 SDs, 0 SdLazy, 5001 SolverSat, 420 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 925 GetRequests, 652 SyntacticMatches, 3 SemanticMatches, 270 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 23.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=11, 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, 14 MinimizatonAttempts, 126 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 83 PreInvPairs, 117 NumberOfFragments, 853 HoareAnnotationTreeSize, 83 FomulaSimplifications, 4802 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 2769 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 1494 NumberOfCodeBlocks, 1491 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1469 ConstructedInterpolants, 42 QuantifiedInterpolants, 459198 SizeOfPredicates, 72 NumberOfNonLiveVariables, 3275 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 408/534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...