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-token-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:06,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:06,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:06,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:06,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:06,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:06,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:06,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:06,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:06,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:06,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:06,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:06,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:06,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:06,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:06,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:06,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:06,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:06,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:06,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:06,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:06,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:06,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:06,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:06,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:06,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:06,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:06,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:06,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:06,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:06,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:06,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:06,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:06,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:06,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:06,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:06,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:06,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:06,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:06,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:06,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:06,939 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:06,964 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:06,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:06,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:06,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:06,973 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:06,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:06,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:06,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:06,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:06,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:06,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:06,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:06,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:06,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:06,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:06,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:06,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:06,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:06,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:06,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:06,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:06,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:06,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:06,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:06,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:06,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:06,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:06,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:06,979 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:07,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:07,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:07,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:07,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:07,281 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:07,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-10-13 20:12:07,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb707464/309902fab8474c4da41ebdd4988c5180/FLAGec5f20588 [2019-10-13 20:12:07,807 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:07,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-10-13 20:12:07,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb707464/309902fab8474c4da41ebdd4988c5180/FLAGec5f20588 [2019-10-13 20:12:08,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb707464/309902fab8474c4da41ebdd4988c5180 [2019-10-13 20:12:08,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:08,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:08,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:08,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:08,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:08,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:08" (1/1) ... [2019-10-13 20:12:08,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67af7f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:08, skipping insertion in model container [2019-10-13 20:12:08,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:08" (1/1) ... [2019-10-13 20:12:08,210 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:08,264 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:08,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:08,719 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:08,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:08,826 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:08,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:08 WrapperNode [2019-10-13 20:12:08,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:08,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:08,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:08,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:08,842 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:08" (1/1) ... [2019-10-13 20:12:08,842 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:08" (1/1) ... [2019-10-13 20:12:08,857 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:08" (1/1) ... [2019-10-13 20:12:08,857 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:08" (1/1) ... [2019-10-13 20:12:08,873 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:08" (1/1) ... [2019-10-13 20:12:08,880 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:08" (1/1) ... [2019-10-13 20:12:08,886 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:08" (1/1) ... [2019-10-13 20:12:08,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:08,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:08,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:08,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:08,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:08" (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:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:08,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:08,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:08,962 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:08,965 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:12:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:12:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:08,966 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:12:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:08,967 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:08,968 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:08,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:09,514 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:09,514 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-13 20:12:09,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:09 BoogieIcfgContainer [2019-10-13 20:12:09,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:09,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:09,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:09,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:09,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:08" (1/3) ... [2019-10-13 20:12:09,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b38ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:09, skipping insertion in model container [2019-10-13 20:12:09,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:08" (2/3) ... [2019-10-13 20:12:09,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b38ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:09, skipping insertion in model container [2019-10-13 20:12:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:09" (3/3) ... [2019-10-13 20:12:09,523 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2019-10-13 20:12:09,533 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:09,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 20:12:09,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 20:12:09,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:09,575 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:09,575 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:09,575 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:09,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:09,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:09,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:09,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-10-13 20:12:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 20:12:09,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:09,600 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:09,602 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2019-10-13 20:12:09,615 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:09,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673558355] [2019-10-13 20:12:09,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:09,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:09,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:09,762 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:09,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673558355] [2019-10-13 20:12:09,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:09,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:09,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238781556] [2019-10-13 20:12:09,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:09,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:09,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:09,790 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-10-13 20:12:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:09,812 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2019-10-13 20:12:09,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:09,813 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 20:12:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:09,823 INFO L225 Difference]: With dead ends: 92 [2019-10-13 20:12:09,823 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 20:12:09,827 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:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 20:12:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-13 20:12:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 20:12:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-13 20:12:09,865 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2019-10-13 20:12:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:09,865 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-13 20:12:09,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-13 20:12:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 20:12:09,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:09,866 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:09,867 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2019-10-13 20:12:09,867 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:09,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256295963] [2019-10-13 20:12:09,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:09,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:09,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:09,972 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:09,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256295963] [2019-10-13 20:12:09,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:09,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:12:09,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775080296] [2019-10-13 20:12:09,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:12:09,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:12:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:12:09,991 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2019-10-13 20:12:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:10,090 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-13 20:12:10,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:10,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-13 20:12:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:10,092 INFO L225 Difference]: With dead ends: 43 [2019-10-13 20:12:10,092 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 20:12:10,093 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:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 20:12:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-13 20:12:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 20:12:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-13 20:12:10,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-10-13 20:12:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:10,100 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-13 20:12:10,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:12:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-13 20:12:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 20:12:10,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:10,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:10,101 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:10,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:10,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2019-10-13 20:12:10,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:10,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112337850] [2019-10-13 20:12:10,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:10,209 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:10,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112337850] [2019-10-13 20:12:10,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:10,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:12:10,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036719335] [2019-10-13 20:12:10,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:12:10,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:12:10,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:12:10,213 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-10-13 20:12:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:10,289 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-13 20:12:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:12:10,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 20:12:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:10,291 INFO L225 Difference]: With dead ends: 67 [2019-10-13 20:12:10,291 INFO L226 Difference]: Without dead ends: 65 [2019-10-13 20:12:10,292 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:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-13 20:12:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-10-13 20:12:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 20:12:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-13 20:12:10,299 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2019-10-13 20:12:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:10,299 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-13 20:12:10,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:12:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-13 20:12:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 20:12:10,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:10,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:10,301 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2019-10-13 20:12:10,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:10,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681943805] [2019-10-13 20:12:10,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:10,360 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:10,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681943805] [2019-10-13 20:12:10,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:10,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:10,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557127145] [2019-10-13 20:12:10,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:10,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:10,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:10,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:10,362 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2019-10-13 20:12:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:10,456 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-13 20:12:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:10,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 20:12:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:10,458 INFO L225 Difference]: With dead ends: 39 [2019-10-13 20:12:10,458 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 20:12:10,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 20:12:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-13 20:12:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 20:12:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-13 20:12:10,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2019-10-13 20:12:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:10,471 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-13 20:12:10,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-13 20:12:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 20:12:10,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:10,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:10,473 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2019-10-13 20:12:10,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:10,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301798810] [2019-10-13 20:12:10,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:10,668 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:10,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301798810] [2019-10-13 20:12:10,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:10,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:10,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183854756] [2019-10-13 20:12:10,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:10,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:10,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:10,670 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2019-10-13 20:12:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:10,815 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-10-13 20:12:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:10,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 20:12:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:10,817 INFO L225 Difference]: With dead ends: 72 [2019-10-13 20:12:10,817 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 20:12:10,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 20:12:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-10-13 20:12:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 20:12:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-13 20:12:10,825 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2019-10-13 20:12:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:10,825 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-13 20:12:10,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-13 20:12:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:10,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:10,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:10,827 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2019-10-13 20:12:10,827 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:10,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070891394] [2019-10-13 20:12:10,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:10,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:10,951 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:10,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070891394] [2019-10-13 20:12:10,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:10,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:12:10,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310429011] [2019-10-13 20:12:10,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:12:10,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:12:10,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:10,953 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2019-10-13 20:12:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:11,111 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-10-13 20:12:11,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:11,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 20:12:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:11,113 INFO L225 Difference]: With dead ends: 54 [2019-10-13 20:12:11,113 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 20:12:11,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 20:12:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-10-13 20:12:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 20:12:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-13 20:12:11,121 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2019-10-13 20:12:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:11,122 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-13 20:12:11,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:12:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-13 20:12:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:11,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:11,123 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:11,123 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:11,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1742673852, now seen corresponding path program 1 times [2019-10-13 20:12:11,124 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:11,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622127343] [2019-10-13 20:12:11,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:11,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:11,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:11,329 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:11,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622127343] [2019-10-13 20:12:11,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654582012] [2019-10-13 20:12:11,330 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:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:11,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 20:12:11,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:11,569 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:11,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:11,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 20:12:11,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:11,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,614 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:11,614 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-13 20:12:11,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 20:12:11,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:11,758 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.4 percent of original size [2019-10-13 20:12:11,767 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:11,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:11,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 20 [2019-10-13 20:12:11,817 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:11,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:11,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:11,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-13 20:12:11,848 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:11,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:11,874 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:11,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:11,896 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:109, output treesize:36 [2019-10-13 20:12:11,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:11,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 20:12:11,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,031 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_21|, |v_#memory_int_31|, |v_#memory_$Pointer$.base_21|, |v_#memory_int_32|], 10=[|v_#memory_int_34|]} [2019-10-13 20:12:12,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:12,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,074 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:12,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:12,113 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,141 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:12,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,200 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-10-13 20:12:12,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2019-10-13 20:12:12,204 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:12,229 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-10-13 20:12:12,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-10-13 20:12:12,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-13 20:12:12,310 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:12,310 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:12,335 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|, |v_#memory_int_32|], 3=[|v_#memory_int_31|]} [2019-10-13 20:12:12,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,449 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-13 20:12:12,450 INFO L567 ElimStorePlain]: treesize reduction 11, result has 95.1 percent of original size [2019-10-13 20:12:12,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:12,565 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-10-13 20:12:12,565 INFO L567 ElimStorePlain]: treesize reduction 79, result has 54.6 percent of original size [2019-10-13 20:12:12,569 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:12,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:12,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:12,605 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:12,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:12,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:12,634 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:157, output treesize:157 [2019-10-13 20:12:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:12,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:14,847 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |v_#memory_int_29|], 10=[|v_#memory_int_30|]} [2019-10-13 20:12:14,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:14,977 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-10-13 20:12:14,977 INFO L567 ElimStorePlain]: treesize reduction 231, result has 38.2 percent of original size [2019-10-13 20:12:14,981 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:15,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:15,019 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:15,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:15,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:15,041 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:613, output treesize:191 [2019-10-13 20:12:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:19,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [626136616] [2019-10-13 20:12:19,140 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 21 [2019-10-13 20:12:19,179 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:12:19,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:12:19,243 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 20:12:19,244 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 37 variables. [2019-10-13 20:12:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:19,248 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 20:12:19,282 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-13 20:12:19,282 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 20:12:19,283 INFO L553 sIntCurrentIteration]: We unified 19 AI predicates to 19 [2019-10-13 20:12:19,283 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 20:12:19,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:12:19,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 7] total 12 [2019-10-13 20:12:19,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945615104] [2019-10-13 20:12:19,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:19,286 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:19,287 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 20:12:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:19,287 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 2 states. [2019-10-13 20:12:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:19,289 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-10-13 20:12:19,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:19,290 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-10-13 20:12:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:19,290 INFO L225 Difference]: With dead ends: 50 [2019-10-13 20:12:19,296 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:12:19,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:12:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:12:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:12:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:12:19,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-10-13 20:12:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:19,298 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:12:19,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:12:19,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:12:19,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:19,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:12:19,545 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,546 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:19,546 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,546 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,546 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 20:12:19,546 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:19,546 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:19,547 INFO L443 ceAbstractionStarter]: For program point L1026-1(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,547 INFO L443 ceAbstractionStarter]: For program point L1026-2(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,547 INFO L443 ceAbstractionStarter]: For program point L1026-4(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,547 INFO L439 ceAbstractionStarter]: At program point L1026-5(line 1026) the Hoare annotation is: false [2019-10-13 20:12:19,547 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,547 INFO L443 ceAbstractionStarter]: For program point L1026-6(line 1026) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 990 1041) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1023) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point L1019-2(lines 991 1041) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point L1036(line 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point L1036-1(line 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point L1036-3(line 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point L1036-4(lines 991 1041) no Hoare annotation was computed. [2019-10-13 20:12:19,548 INFO L443 ceAbstractionStarter]: For program point L1036-5(line 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,549 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 990 1041) no Hoare annotation was computed. [2019-10-13 20:12:19,549 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 990 1041) the Hoare annotation is: true [2019-10-13 20:12:19,549 INFO L443 ceAbstractionStarter]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,549 INFO L443 ceAbstractionStarter]: For program point L1021-2(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,549 INFO L443 ceAbstractionStarter]: For program point L1021-4(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,549 INFO L439 ceAbstractionStarter]: At program point L1021-5(line 1021) the Hoare annotation is: false [2019-10-13 20:12:19,549 INFO L443 ceAbstractionStarter]: For program point L1021-6(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,549 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:19,550 INFO L443 ceAbstractionStarter]: For program point L1030-1(lines 1030 1035) no Hoare annotation was computed. [2019-10-13 20:12:19,550 INFO L439 ceAbstractionStarter]: At program point L1030-3(lines 1030 1035) the Hoare annotation is: false [2019-10-13 20:12:19,550 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1008) no Hoare annotation was computed. [2019-10-13 20:12:19,550 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:19,550 INFO L443 ceAbstractionStarter]: For program point L1024(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:19,550 INFO L443 ceAbstractionStarter]: For program point L1024-1(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:19,550 INFO L443 ceAbstractionStarter]: For program point L1024-3(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:19,551 INFO L443 ceAbstractionStarter]: For program point L1024-4(lines 991 1041) no Hoare annotation was computed. [2019-10-13 20:12:19,551 INFO L443 ceAbstractionStarter]: For program point L1024-5(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:19,551 INFO L443 ceAbstractionStarter]: For program point L1008-1(line 1008) no Hoare annotation was computed. [2019-10-13 20:12:19,551 INFO L443 ceAbstractionStarter]: For program point L1008-3(line 1008) no Hoare annotation was computed. [2019-10-13 20:12:19,551 INFO L439 ceAbstractionStarter]: At program point L1008-4(line 1008) the Hoare annotation is: false [2019-10-13 20:12:19,551 INFO L439 ceAbstractionStarter]: At program point L1008-5(lines 1001 1009) the Hoare annotation is: false [2019-10-13 20:12:19,551 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1021) no Hoare annotation was computed. [2019-10-13 20:12:19,551 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1036) no Hoare annotation was computed. [2019-10-13 20:12:19,552 INFO L443 ceAbstractionStarter]: For program point L1017-1(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:19,552 INFO L443 ceAbstractionStarter]: For program point L1017-3(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:19,552 INFO L439 ceAbstractionStarter]: At program point L1017-4(line 1017) the Hoare annotation is: false [2019-10-13 20:12:19,552 INFO L443 ceAbstractionStarter]: For program point L1001-1(lines 1001 1009) no Hoare annotation was computed. [2019-10-13 20:12:19,552 INFO L443 ceAbstractionStarter]: For program point L1001-3(lines 1001 1009) no Hoare annotation was computed. [2019-10-13 20:12:19,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:19 BoogieIcfgContainer [2019-10-13 20:12:19,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:12:19,563 INFO L168 Benchmark]: Toolchain (without parser) took 11368.74 ms. Allocated memory was 140.0 MB in the beginning and 246.9 MB in the end (delta: 107.0 MB). Free memory was 102.4 MB in the beginning and 149.7 MB in the end (delta: -47.3 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,564 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.55 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.9 MB in the beginning and 171.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,565 INFO L168 Benchmark]: Boogie Preprocessor took 65.31 ms. Allocated memory is still 205.0 MB. Free memory was 171.6 MB in the beginning and 169.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,566 INFO L168 Benchmark]: RCFGBuilder took 621.98 ms. Allocated memory is still 205.0 MB. Free memory was 168.3 MB in the beginning and 122.0 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,567 INFO L168 Benchmark]: TraceAbstraction took 10044.71 ms. Allocated memory was 205.0 MB in the beginning and 246.9 MB in the end (delta: 41.9 MB). Free memory was 122.0 MB in the beginning and 149.7 MB in the end (delta: -27.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:19,573 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.19 ms. Allocated memory is still 140.0 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 632.55 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.9 MB in the beginning and 171.6 MB in the end (delta: -69.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.31 ms. Allocated memory is still 205.0 MB. Free memory was 171.6 MB in the beginning and 169.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 621.98 ms. Allocated memory is still 205.0 MB. Free memory was 168.3 MB in the beginning and 122.0 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10044.71 ms. Allocated memory was 205.0 MB in the beginning and 246.9 MB in the end (delta: 41.9 MB). Free memory was 122.0 MB in the beginning and 149.7 MB in the end (delta: -27.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1026]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1036]: 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: 1021]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1008]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 1017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1030]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1008]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 6 error locations. Result: SAFE, OverallTime: 9.9s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 221 SDtfs, 100 SDslu, 331 SDs, 0 SdLazy, 203 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, 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, 32 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 10 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 134 ConstructedInterpolants, 12 QuantifiedInterpolants, 41836 SizeOfPredicates, 13 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 108, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9210526315789473, AVG_VARS_REMOVED_DURING_WEAKENING: 1.1578947368421053, AVG_WEAKENED_CONJUNCTS: 0.3157894736842105, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...