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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:11,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:11,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:11,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:11,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:11,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:11,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:11,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:11,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:11,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:11,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:11,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:11,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:11,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:11,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:11,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:11,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:11,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:11,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:11,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:11,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:11,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:11,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:11,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:11,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:11,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:11,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:11,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:11,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:11,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:11,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:11,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:11,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:11,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:11,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:11,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:11,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:11,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:11,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:11,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:11,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:11,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:12:11,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:11,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:11,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:11,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:11,788 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:11,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:11,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:11,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:11,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:11,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:11,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:11,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:11,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:11,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:11,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:11,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:11,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:11,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:11,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:11,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:11,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:11,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:11,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:11,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:11,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:11,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:11,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:11,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:11,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:12:12,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:12,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:12,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:12,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:12,122 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:12,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-10-13 20:12:12,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e864c592a/5e32191e7f284acaa899811d646d5dc5/FLAG6cdde5925 [2019-10-13 20:12:12,712 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:12,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-10-13 20:12:12,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e864c592a/5e32191e7f284acaa899811d646d5dc5/FLAG6cdde5925 [2019-10-13 20:12:13,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e864c592a/5e32191e7f284acaa899811d646d5dc5 [2019-10-13 20:12:13,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:13,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:13,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:13,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:13,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:13,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319c2be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13, skipping insertion in model container [2019-10-13 20:12:13,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,047 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:13,103 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:13,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:13,558 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:13,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:13,703 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:13,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13 WrapperNode [2019-10-13 20:12:13,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:13,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:13,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:13,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:13,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... [2019-10-13 20:12:13,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:13,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:13,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:13,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:13,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:13,845 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:13,848 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:13,849 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:13,850 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:12:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:12:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:12:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:13,855 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:13,856 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:14,380 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:14,381 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 20:12:14,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:14 BoogieIcfgContainer [2019-10-13 20:12:14,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:14,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:14,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:14,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:14,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:13" (1/3) ... [2019-10-13 20:12:14,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c7e774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:14, skipping insertion in model container [2019-10-13 20:12:14,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:13" (2/3) ... [2019-10-13 20:12:14,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c7e774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:14, skipping insertion in model container [2019-10-13 20:12:14,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:14" (3/3) ... [2019-10-13 20:12:14,391 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-10-13 20:12:14,402 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:14,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-13 20:12:14,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-13 20:12:14,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:14,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:14,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:14,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:14,446 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:14,446 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:14,446 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:14,446 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 20:12:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 20:12:14,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:14,471 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:14,473 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-10-13 20:12:14,487 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:14,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618320402] [2019-10-13 20:12:14,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:14,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:14,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:14,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618320402] [2019-10-13 20:12:14,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:14,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:14,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922074204] [2019-10-13 20:12:14,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:14,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:14,655 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-10-13 20:12:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:14,678 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-10-13 20:12:14,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:14,680 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 20:12:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:14,688 INFO L225 Difference]: With dead ends: 70 [2019-10-13 20:12:14,689 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 20:12:14,692 INFO L600 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-13 20:12:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 20:12:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 20:12:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 20:12:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-13 20:12:14,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-10-13 20:12:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:14,734 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-13 20:12:14,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-13 20:12:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 20:12:14,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:14,735 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:14,735 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-10-13 20:12:14,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:14,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909682125] [2019-10-13 20:12:14,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:14,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:14,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:14,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909682125] [2019-10-13 20:12:14,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:14,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:12:14,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538517514] [2019-10-13 20:12:14,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:12:14,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:14,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:12:14,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:12:15,000 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-10-13 20:12:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:15,141 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-13 20:12:15,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:12:15,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 20:12:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:15,144 INFO L225 Difference]: With dead ends: 46 [2019-10-13 20:12:15,144 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 20:12:15,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 20:12:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-10-13 20:12:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 20:12:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-13 20:12:15,160 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-10-13 20:12:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:15,162 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-13 20:12:15,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:12:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-13 20:12:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 20:12:15,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:15,165 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:15,165 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-10-13 20:12:15,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:15,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202516221] [2019-10-13 20:12:15,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:15,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202516221] [2019-10-13 20:12:15,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:15,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:15,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103509214] [2019-10-13 20:12:15,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:15,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:15,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:15,268 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2019-10-13 20:12:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:15,295 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-10-13 20:12:15,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:15,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 20:12:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:15,298 INFO L225 Difference]: With dead ends: 75 [2019-10-13 20:12:15,299 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 20:12:15,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 20:12:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-10-13 20:12:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 20:12:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-13 20:12:15,308 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-10-13 20:12:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:15,308 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-13 20:12:15,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-13 20:12:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 20:12:15,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:15,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:15,310 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:15,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-10-13 20:12:15,311 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:15,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497810602] [2019-10-13 20:12:15,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:15,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497810602] [2019-10-13 20:12:15,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:15,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:15,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328075420] [2019-10-13 20:12:15,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:15,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:15,352 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 3 states. [2019-10-13 20:12:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:15,369 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-10-13 20:12:15,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:15,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 20:12:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:15,370 INFO L225 Difference]: With dead ends: 42 [2019-10-13 20:12:15,370 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 20:12:15,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 20:12:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-13 20:12:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 20:12:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-13 20:12:15,377 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-10-13 20:12:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:15,378 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-13 20:12:15,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-13 20:12:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 20:12:15,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:15,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:15,380 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-10-13 20:12:15,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:15,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797308967] [2019-10-13 20:12:15,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:15,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797308967] [2019-10-13 20:12:15,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:15,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:15,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627760651] [2019-10-13 20:12:15,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:15,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:15,568 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-10-13 20:12:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:15,759 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-10-13 20:12:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:15,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 20:12:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:15,760 INFO L225 Difference]: With dead ends: 51 [2019-10-13 20:12:15,761 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 20:12:15,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 20:12:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-13 20:12:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 20:12:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-13 20:12:15,768 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-10-13 20:12:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:15,768 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-13 20:12:15,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-13 20:12:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 20:12:15,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:15,769 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:15,770 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-10-13 20:12:15,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:15,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837471262] [2019-10-13 20:12:15,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:15,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:15,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837471262] [2019-10-13 20:12:15,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389830881] [2019-10-13 20:12:15,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:15,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 20:12:15,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:16,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 20:12:16,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 20:12:16,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 20:12:16,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-10-13 20:12:16,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-13 20:12:16,205 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 20:12:16,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 21 [2019-10-13 20:12:16,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-10-13 20:12:16,244 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_20|]} [2019-10-13 20:12:16,252 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:16,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,284 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-10-13 20:12:16,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:16,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,305 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-10-13 20:12:16,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,307 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-13 20:12:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:16,310 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:16,320 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:16,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:16,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-13 20:12:16,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:16,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:16,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:16,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-10-13 20:12:16,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 174 [2019-10-13 20:12:16,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 20:12:16,573 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-10-13 20:12:16,574 INFO L567 ElimStorePlain]: treesize reduction 127, result has 28.7 percent of original size [2019-10-13 20:12:16,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:16,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:16,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:16,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:16,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-13 20:12:16,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2019-10-13 20:12:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:16,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1270849801] [2019-10-13 20:12:16,691 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-10-13 20:12:16,734 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:12:16,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:12:16,807 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 20:12:16,809 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 31 variables. [2019-10-13 20:12:16,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:16,813 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 20:12:16,854 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-13 20:12:16,854 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 20:12:16,856 INFO L553 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-10-13 20:12:16,856 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 20:12:16,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:12:16,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 5, 5] total 8 [2019-10-13 20:12:16,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194134995] [2019-10-13 20:12:16,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:16,864 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:16,864 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 20:12:16,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:16,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:16,866 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 2 states. [2019-10-13 20:12:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:16,869 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-10-13 20:12:16,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:16,870 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-13 20:12:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:16,870 INFO L225 Difference]: With dead ends: 38 [2019-10-13 20:12:16,870 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:12:16,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-13 20:12:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:12:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:12:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:12:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:12:16,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-13 20:12:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:16,872 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:12:16,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:12:16,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:12:17,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:17,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:12:17,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:17,154 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:17,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:17,154 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:17,154 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 20:12:17,155 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:17,155 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:17,155 INFO L443 ceAbstractionStarter]: For program point L993-1(lines 993 1013) no Hoare annotation was computed. [2019-10-13 20:12:17,155 INFO L443 ceAbstractionStarter]: For program point L993-3(lines 993 1013) no Hoare annotation was computed. [2019-10-13 20:12:17,155 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 982 1036) no Hoare annotation was computed. [2019-10-13 20:12:17,155 INFO L443 ceAbstractionStarter]: For program point L1002(lines 1002 1007) no Hoare annotation was computed. [2019-10-13 20:12:17,155 INFO L443 ceAbstractionStarter]: For program point L1027-1(lines 1027 1032) no Hoare annotation was computed. [2019-10-13 20:12:17,156 INFO L446 ceAbstractionStarter]: At program point L1027-3(lines 1027 1032) the Hoare annotation is: true [2019-10-13 20:12:17,156 INFO L443 ceAbstractionStarter]: For program point L1027-4(lines 1027 1032) no Hoare annotation was computed. [2019-10-13 20:12:17,156 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1023) no Hoare annotation was computed. [2019-10-13 20:12:17,156 INFO L443 ceAbstractionStarter]: For program point L1019-2(lines 983 1036) no Hoare annotation was computed. [2019-10-13 20:12:17,157 INFO L443 ceAbstractionStarter]: For program point L1019-3(lines 1019 1023) no Hoare annotation was computed. [2019-10-13 20:12:17,158 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:17,158 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:17,158 INFO L443 ceAbstractionStarter]: For program point L1012-1(line 1012) no Hoare annotation was computed. [2019-10-13 20:12:17,158 INFO L443 ceAbstractionStarter]: For program point L1012-3(line 1012) no Hoare annotation was computed. [2019-10-13 20:12:17,158 INFO L439 ceAbstractionStarter]: At program point L1012-4(line 1012) the Hoare annotation is: false [2019-10-13 20:12:17,158 INFO L439 ceAbstractionStarter]: At program point L1012-5(lines 993 1013) the Hoare annotation is: false [2019-10-13 20:12:17,159 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 982 1036) no Hoare annotation was computed. [2019-10-13 20:12:17,159 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1007) no Hoare annotation was computed. [2019-10-13 20:12:17,159 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 982 1036) the Hoare annotation is: true [2019-10-13 20:12:17,159 INFO L443 ceAbstractionStarter]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:17,159 INFO L443 ceAbstractionStarter]: For program point L1021-3(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:17,159 INFO L443 ceAbstractionStarter]: For program point L1021-4(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:17,159 INFO L443 ceAbstractionStarter]: For program point L1021-6(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:17,160 INFO L439 ceAbstractionStarter]: At program point L1021-7(line 1021) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (.cse1 (select |#memory_$Pointer$.base| main_~x~0.base))) (and (= main_~head~0.offset .cse0) (= main_~head~0.offset main_~x~0.offset) (= 0 .cse0) (= (select (select |#memory_int| (select .cse1 main_~x~0.offset)) 4) 1) (= 1 main_~state~0) (= main_~head~0.base main_~x~0.base) (= (select .cse1 main_~head~0.offset) main_~head~0.base))) [2019-10-13 20:12:17,160 INFO L443 ceAbstractionStarter]: For program point L1021-8(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:17,160 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1008) no Hoare annotation was computed. [2019-10-13 20:12:17,160 INFO L443 ceAbstractionStarter]: For program point L1000-1(lines 1000 1008) no Hoare annotation was computed. [2019-10-13 20:12:17,160 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-13 20:12:17,160 INFO L443 ceAbstractionStarter]: For program point L1017-1(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:17,161 INFO L443 ceAbstractionStarter]: For program point L1017-3(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:17,161 INFO L439 ceAbstractionStarter]: At program point L1017-4(line 1017) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (.cse1 (select |#memory_$Pointer$.base| main_~x~0.base))) (and (= main_~head~0.offset .cse0) (not (= 0 main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 .cse0) (= (select (select |#memory_int| (select .cse1 main_~x~0.offset)) 4) 1) (= 1 main_~state~0) (= main_~head~0.base main_~x~0.base) (= (select .cse1 main_~head~0.offset) main_~head~0.base))) [2019-10-13 20:12:17,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,179 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,182 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,182 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,183 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,190 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,191 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,191 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:17 BoogieIcfgContainer [2019-10-13 20:12:17,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:12:17,211 INFO L168 Benchmark]: Toolchain (without parser) took 4189.40 ms. Allocated memory was 136.8 MB in the beginning and 251.1 MB in the end (delta: 114.3 MB). Free memory was 99.4 MB in the beginning and 159.1 MB in the end (delta: -59.7 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:17,212 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-13 20:12:17,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.56 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 167.8 MB in the end (delta: -68.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:17,220 INFO L168 Benchmark]: Boogie Preprocessor took 67.97 ms. Allocated memory is still 200.8 MB. Free memory was 167.8 MB in the beginning and 165.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:17,222 INFO L168 Benchmark]: RCFGBuilder took 609.15 ms. Allocated memory is still 200.8 MB. Free memory was 165.0 MB in the beginning and 121.7 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:17,226 INFO L168 Benchmark]: TraceAbstraction took 2824.48 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 121.0 MB in the beginning and 159.1 MB in the end (delta: -38.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:17,234 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.22 ms. Allocated memory is still 136.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 677.56 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 167.8 MB in the end (delta: -68.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 67.97 ms. Allocated memory is still 200.8 MB. Free memory was 167.8 MB in the beginning and 165.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 609.15 ms. Allocated memory is still 200.8 MB. Free memory was 165.0 MB in the beginning and 121.7 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2824.48 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 121.0 MB in the beginning and 159.1 MB in the end (delta: -38.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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_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_$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_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1021]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 1012]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1027]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1017]: Loop Invariant [2019-10-13 20:12:17,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((head == #memory_$Pointer$[x][head] && !(0 == x)) && head == x) && 0 == #memory_$Pointer$[x][head]) && unknown-#memory_int-unknown[#memory_$Pointer$[x][x]][4] == 1) && 1 == state) && head == x) && #memory_$Pointer$[x][head] == head - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1021]: Loop Invariant [2019-10-13 20:12:17,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,261 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,262 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:17,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:17,266 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:17,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:17,267 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((head == #memory_$Pointer$[x][head] && head == x) && 0 == #memory_$Pointer$[x][head]) && unknown-#memory_int-unknown[#memory_$Pointer$[x][x]][4] == 1) && 1 == state) && head == x) && #memory_$Pointer$[x][head] == head - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 3 error locations. Result: SAFE, OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 160 SDtfs, 55 SDslu, 150 SDs, 0 SdLazy, 84 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 95 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 9 QuantifiedInterpolants, 14002 SizeOfPredicates, 7 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 122, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.890625, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9375, AVG_WEAKENED_CONJUNCTS: 0.375, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...