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/dll-rb-cnstr_1-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:10:58,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:10:58,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:10:58,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:10:58,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:10:58,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:10:58,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:10:58,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:10:58,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:10:58,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:10:58,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:10:58,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:10:58,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:10:58,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:10:58,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:10:58,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:10:58,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:10:58,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:10:58,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:10:58,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:10:58,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:10:58,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:10:58,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:10:58,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:10:58,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:10:58,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:10:58,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:10:58,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:10:58,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:10:58,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:10:58,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:10:58,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:10:58,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:10:58,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:10:58,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:10:58,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:10:58,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:10:58,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:10:58,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:10:58,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:10:58,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:10:58,793 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-15 00:10:58,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:10:58,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:10:58,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:10:58,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:10:58,809 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:10:58,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:10:58,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:10:58,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:10:58,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:10:58,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:10:58,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:10:58,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:10:58,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:10:58,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:10:58,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:10:58,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:10:58,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:10:58,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:10:58,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:10:58,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:10:58,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:10:58,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:10:58,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:10:58,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:10:58,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:10:58,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:10:58,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:10:58,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:10:58,813 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-15 00:10:59,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:10:59,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:10:59,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:10:59,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:10:59,082 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:10:59,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-10-15 00:10:59,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7140861/588a1ca08e0247c8b291bfc88a7b50e8/FLAG810768aa0 [2019-10-15 00:10:59,696 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:10:59,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1-1.i [2019-10-15 00:10:59,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7140861/588a1ca08e0247c8b291bfc88a7b50e8/FLAG810768aa0 [2019-10-15 00:11:00,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7140861/588a1ca08e0247c8b291bfc88a7b50e8 [2019-10-15 00:11:00,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:11:00,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:11:00,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:00,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:11:00,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:11:00,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7e2ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00, skipping insertion in model container [2019-10-15 00:11:00,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,065 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:11:00,110 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:11:00,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:00,564 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:11:00,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:00,674 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:11:00,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00 WrapperNode [2019-10-15 00:11:00,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:00,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:11:00,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:11:00,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:11:00,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (1/1) ... [2019-10-15 00:11:00,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:11:00,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:11:00,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:11:00,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:11:00,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (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-15 00:11:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:11:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:11:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:11:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:11:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:11:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:11:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:11:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:11:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:11:00,806 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:11:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:11:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:11:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:11:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:11:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:11:00,807 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:11:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:11:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:11:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:11:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:11:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:11:00,808 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:11:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:11:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:11:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:11:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:11:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:11:00,809 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:11:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:11:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:11:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:11:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:11:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:11:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:11:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:11:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:11:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:11:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:11:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:11:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:11:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:11:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:11:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:11:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:11:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:11:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:11:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:11:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:11:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:11:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:11:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:11:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:11:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:11:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:11:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:11:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:11:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:11:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:11:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:11:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:11:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:11:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:11:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:11:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:11:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:11:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:11:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:11:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:11:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:11:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:11:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:11:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:11:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:11:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:11:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:11:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:11:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:11:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:11:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:11:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:11:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:11:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:11:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:11:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:11:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:11:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:11:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:11:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:11:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:11:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:11:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:11:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:11:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:11:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:11:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:11:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:11:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:11:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:11:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:11:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:11:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:11:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:11:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:11:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:11:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:11:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:11:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:11:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:11:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:11:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:11:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:11:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:11:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:11:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:11:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:11:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:11:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:11:01,444 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:11:01,444 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-10-15 00:11:01,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:01 BoogieIcfgContainer [2019-10-15 00:11:01,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:11:01,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:11:01,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:11:01,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:11:01,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:11:00" (1/3) ... [2019-10-15 00:11:01,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd36334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:01, skipping insertion in model container [2019-10-15 00:11:01,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:00" (2/3) ... [2019-10-15 00:11:01,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd36334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:01, skipping insertion in model container [2019-10-15 00:11:01,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:01" (3/3) ... [2019-10-15 00:11:01,453 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2019-10-15 00:11:01,462 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:11:01,470 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-15 00:11:01,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-15 00:11:01,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:11:01,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:11:01,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:11:01,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:11:01,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:11:01,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:11:01,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:11:01,513 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:11:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-10-15 00:11:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 00:11:01,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:01,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:01,540 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1255802584, now seen corresponding path program 1 times [2019-10-15 00:11:01,556 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:01,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093434262] [2019-10-15 00:11:01,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:01,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:01,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:01,707 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-15 00:11:01,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093434262] [2019-10-15 00:11:01,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:01,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 00:11:01,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982879316] [2019-10-15 00:11:01,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:01,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:01,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:01,729 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-10-15 00:11:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:01,751 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-10-15 00:11:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:01,752 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-15 00:11:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:01,761 INFO L225 Difference]: With dead ends: 98 [2019-10-15 00:11:01,762 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 00:11:01,765 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-15 00:11:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 00:11:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-15 00:11:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-15 00:11:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-10-15 00:11:01,799 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2019-10-15 00:11:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:01,800 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-10-15 00:11:01,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-10-15 00:11:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 00:11:01,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:01,801 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:01,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash -338068956, now seen corresponding path program 1 times [2019-10-15 00:11:01,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:01,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444505153] [2019-10-15 00:11:01,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:01,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:01,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:01,894 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-15 00:11:01,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444505153] [2019-10-15 00:11:01,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:01,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:01,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105944120] [2019-10-15 00:11:01,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:01,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:01,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:01,899 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-10-15 00:11:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:01,995 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-15 00:11:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:01,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 00:11:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:01,997 INFO L225 Difference]: With dead ends: 48 [2019-10-15 00:11:01,997 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 00:11:01,998 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-15 00:11:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 00:11:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-10-15 00:11:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 00:11:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-15 00:11:02,005 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 11 [2019-10-15 00:11:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,006 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-15 00:11:02,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-15 00:11:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 00:11:02,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,007 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,007 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1890143313, now seen corresponding path program 1 times [2019-10-15 00:11:02,008 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644083294] [2019-10-15 00:11:02,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,127 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-15 00:11:02,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644083294] [2019-10-15 00:11:02,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:02,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045827613] [2019-10-15 00:11:02,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:02,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:02,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:02,131 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-10-15 00:11:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:02,189 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-10-15 00:11:02,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:02,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 00:11:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:02,192 INFO L225 Difference]: With dead ends: 41 [2019-10-15 00:11:02,192 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 00:11:02,193 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-15 00:11:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 00:11:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-15 00:11:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 00:11:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-15 00:11:02,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 12 [2019-10-15 00:11:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,199 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-15 00:11:02,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-15 00:11:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 00:11:02,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,201 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash 290038970, now seen corresponding path program 1 times [2019-10-15 00:11:02,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154849941] [2019-10-15 00:11:02,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,325 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-15 00:11:02,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154849941] [2019-10-15 00:11:02,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:02,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005378498] [2019-10-15 00:11:02,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:02,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:02,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:02,331 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2019-10-15 00:11:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:02,465 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-10-15 00:11:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:11:02,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-15 00:11:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:02,467 INFO L225 Difference]: With dead ends: 64 [2019-10-15 00:11:02,467 INFO L226 Difference]: Without dead ends: 62 [2019-10-15 00:11:02,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:11:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-15 00:11:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2019-10-15 00:11:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 00:11:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-15 00:11:02,475 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 14 [2019-10-15 00:11:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,475 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-15 00:11:02,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-15 00:11:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 00:11:02,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,477 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2060721718, now seen corresponding path program 1 times [2019-10-15 00:11:02,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568678300] [2019-10-15 00:11:02,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,602 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-15 00:11:02,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568678300] [2019-10-15 00:11:02,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:02,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072490018] [2019-10-15 00:11:02,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:02,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:02,607 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2019-10-15 00:11:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:02,688 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-10-15 00:11:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:02,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 00:11:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:02,692 INFO L225 Difference]: With dead ends: 46 [2019-10-15 00:11:02,692 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 00:11:02,693 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-15 00:11:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 00:11:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-15 00:11:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 00:11:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-15 00:11:02,706 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 15 [2019-10-15 00:11:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,706 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-15 00:11:02,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-15 00:11:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 00:11:02,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,712 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,713 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1568846049, now seen corresponding path program 1 times [2019-10-15 00:11:02,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70922977] [2019-10-15 00:11:02,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:02,849 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-15 00:11:02,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70922977] [2019-10-15 00:11:02,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:02,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:02,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533936494] [2019-10-15 00:11:02,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:02,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:02,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:02,852 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-10-15 00:11:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:02,944 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-15 00:11:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:11:02,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 00:11:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:02,946 INFO L225 Difference]: With dead ends: 59 [2019-10-15 00:11:02,946 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 00:11:02,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:11:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 00:11:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-15 00:11:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 00:11:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-15 00:11:02,956 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2019-10-15 00:11:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:02,957 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-15 00:11:02,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-15 00:11:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 00:11:02,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:02,958 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:02,960 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:02,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash 777661568, now seen corresponding path program 1 times [2019-10-15 00:11:02,961 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:02,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052981361] [2019-10-15 00:11:02,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:02,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:03,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052981361] [2019-10-15 00:11:03,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518513549] [2019-10-15 00:11:03,059 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-15 00:11:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:03,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 00:11:03,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:11:03,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:03,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:03,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:03,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-15 00:11:03,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:03,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:03,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:03,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:03,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:03,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-15 00:11:03,300 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:03,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:03,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:03,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:36 [2019-10-15 00:11:03,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-15 00:11:03,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:03,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:03,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:03,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 10 [2019-10-15 00:11:03,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:03,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:03,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:03,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-10-15 00:11:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:03,411 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:11:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:03,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1360664344] [2019-10-15 00:11:03,441 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 22 [2019-10-15 00:11:03,480 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:11:03,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 00:11:03,561 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 00:11:03,563 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-15 00:11:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:03,567 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 00:11:03,623 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 00:11:03,623 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 00:11:03,625 INFO L553 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2019-10-15 00:11:03,625 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 00:11:03,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:11:03,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 5, 5] total 7 [2019-10-15 00:11:03,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079627032] [2019-10-15 00:11:03,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:03,628 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:03,628 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 00:11:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:03,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:03,629 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 2 states. [2019-10-15 00:11:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:03,634 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-10-15 00:11:03,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:03,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-10-15 00:11:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:03,635 INFO L225 Difference]: With dead ends: 46 [2019-10-15 00:11:03,635 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:11:03,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-15 00:11:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:11:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:11:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:11:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:11:03,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-15 00:11:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:03,637 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:11:03,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:11:03,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:11:03,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:03,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:11:03,863 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:03,864 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:03,864 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:03,864 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:03,864 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 00:11:03,864 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:03,864 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:03,864 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 991 1065) no Hoare annotation was computed. [2019-10-15 00:11:03,864 INFO L443 ceAbstractionStarter]: For program point L1010(lines 1010 1022) no Hoare annotation was computed. [2019-10-15 00:11:03,864 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1039) no Hoare annotation was computed. [2019-10-15 00:11:03,864 INFO L443 ceAbstractionStarter]: For program point L1002-1(lines 1002 1026) no Hoare annotation was computed. [2019-10-15 00:11:03,865 INFO L443 ceAbstractionStarter]: For program point L1002-3(lines 1002 1026) no Hoare annotation was computed. [2019-10-15 00:11:03,865 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1025) no Hoare annotation was computed. [2019-10-15 00:11:03,865 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1041) no Hoare annotation was computed. [2019-10-15 00:11:03,865 INFO L443 ceAbstractionStarter]: For program point L1036-1(lines 1036 1041) no Hoare annotation was computed. [2019-10-15 00:11:03,865 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1032) no Hoare annotation was computed. [2019-10-15 00:11:03,865 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 991 1065) no Hoare annotation was computed. [2019-10-15 00:11:03,865 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 991 1065) the Hoare annotation is: true [2019-10-15 00:11:03,865 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1023) no Hoare annotation was computed. [2019-10-15 00:11:03,866 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:03,866 INFO L443 ceAbstractionStarter]: For program point L1047-1(lines 1047 1062) no Hoare annotation was computed. [2019-10-15 00:11:03,866 INFO L443 ceAbstractionStarter]: For program point L1039-1(line 1039) no Hoare annotation was computed. [2019-10-15 00:11:03,866 INFO L443 ceAbstractionStarter]: For program point L1039-3(line 1039) no Hoare annotation was computed. [2019-10-15 00:11:03,866 INFO L439 ceAbstractionStarter]: At program point L1039-4(line 1039) the Hoare annotation is: false [2019-10-15 00:11:03,866 INFO L443 ceAbstractionStarter]: For program point L1023(line 1023) no Hoare annotation was computed. [2019-10-15 00:11:03,866 INFO L443 ceAbstractionStarter]: For program point L1023-1(line 1023) no Hoare annotation was computed. [2019-10-15 00:11:03,866 INFO L443 ceAbstractionStarter]: For program point L1023-3(line 1023) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1023-4(lines 1003 1026) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1040(line 1040) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1040-1(line 1040) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1040-3(line 1040) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1040-4(lines 1037 1041) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1040) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1032-3(line 1032) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L439 ceAbstractionStarter]: At program point L1032-4(line 1032) the Hoare annotation is: false [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1024(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1024-1(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:03,867 INFO L443 ceAbstractionStarter]: For program point L1024-3(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1024-4(lines 1003 1026) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1061) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1049-2(lines 992 1065) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1033(line 1033) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1033-1(line 1033) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1033-3(line 1033) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1033-4(lines 992 1065) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1025(line 1025) no Hoare annotation was computed. [2019-10-15 00:11:03,868 INFO L443 ceAbstractionStarter]: For program point L1025-2(line 1025) no Hoare annotation was computed. [2019-10-15 00:11:03,869 INFO L443 ceAbstractionStarter]: For program point L1025-3(lines 1003 1026) no Hoare annotation was computed. [2019-10-15 00:11:03,869 INFO L439 ceAbstractionStarter]: At program point L1025-4(lines 1002 1026) the Hoare annotation is: false [2019-10-15 00:11:03,869 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1033) no Hoare annotation was computed. [2019-10-15 00:11:03,869 INFO L443 ceAbstractionStarter]: For program point L1034-1(lines 992 1065) no Hoare annotation was computed. [2019-10-15 00:11:03,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:11:03 BoogieIcfgContainer [2019-10-15 00:11:03,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:11:03,878 INFO L168 Benchmark]: Toolchain (without parser) took 3832.80 ms. Allocated memory was 138.4 MB in the beginning and 248.5 MB in the end (delta: 110.1 MB). Free memory was 101.4 MB in the beginning and 183.5 MB in the end (delta: -82.2 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:03,879 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 00:11:03,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.20 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 168.2 MB in the end (delta: -67.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:03,881 INFO L168 Benchmark]: Boogie Preprocessor took 77.88 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 164.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:03,881 INFO L168 Benchmark]: RCFGBuilder took 687.60 ms. Allocated memory is still 201.9 MB. Free memory was 164.9 MB in the beginning and 116.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:03,882 INFO L168 Benchmark]: TraceAbstraction took 2430.10 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 115.5 MB in the beginning and 183.5 MB in the end (delta: -68.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 00:11:03,886 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 629.20 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 168.2 MB in the end (delta: -67.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.88 ms. Allocated memory is still 201.9 MB. Free memory was 168.2 MB in the beginning and 164.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 687.60 ms. Allocated memory is still 201.9 MB. Free memory was 164.9 MB in the beginning and 116.2 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2430.10 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 115.5 MB in the beginning and 183.5 MB in the end (delta: -68.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1023]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1033]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1032]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1039]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1040]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 1032]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. Result: SAFE, OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 225 SDtfs, 124 SDslu, 263 SDs, 0 SdLazy, 152 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, 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, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 18722 SizeOfPredicates, 9 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 126, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.925, AVG_VARS_REMOVED_DURING_WEAKENING: 0.85, AVG_WEAKENED_CONJUNCTS: 0.3, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...