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-13a467a-m [2019-10-15 00:11:05,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:11:05,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:11:05,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:11:05,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:11:05,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:11:05,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:11:05,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:11:05,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:11:05,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:11:05,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:11:05,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:11:05,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:11:05,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:11:05,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:11:05,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:11:05,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:11:05,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:11:05,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:11:05,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:11:05,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:11:05,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:11:05,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:11:05,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:11:05,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:11:05,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:11:05,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:11:05,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:11:05,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:11:05,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:11:05,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:11:05,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:11:05,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:11:05,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:11:05,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:11:05,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:11:05,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:11:05,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:11:05,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:11:05,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:11:05,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:11:05,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 00:11:05,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:11:05,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:11:05,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:11:05,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:11:05,170 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:11:05,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:11:05,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:11:05,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:11:05,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:11:05,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:11:05,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:11:05,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:11:05,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:11:05,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:11:05,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:11:05,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:11:05,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:11:05,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:11:05,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:11:05,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:11:05,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:11:05,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:11:05,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:11:05,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:11:05,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:11:05,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:11:05,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:11:05,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:11:05,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 00:11:05,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:11:05,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:11:05,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:11:05,459 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:11:05,460 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:11:05,461 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-15 00:11:05,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcb9022/74fe609a26ed4e3e97dd2f89369b223a/FLAG197555ac6 [2019-10-15 00:11:06,114 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:11:06,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-10-15 00:11:06,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcb9022/74fe609a26ed4e3e97dd2f89369b223a/FLAG197555ac6 [2019-10-15 00:11:06,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5dcb9022/74fe609a26ed4e3e97dd2f89369b223a [2019-10-15 00:11:06,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:11:06,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:11:06,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:06,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:11:06,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:11:06,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:06,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405f9137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06, skipping insertion in model container [2019-10-15 00:11:06,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:06,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:11:06,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:11:06,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:06,863 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:11:06,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:06,975 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:11:06,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06 WrapperNode [2019-10-15 00:11:06,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:06,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:11:06,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:11:06,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:11:06,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:06,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:07,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:07,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:07,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:07,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:07,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... [2019-10-15 00:11:07,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:11:07,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:11:07,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:11:07,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:11:07,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:11:07,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:11:07,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:11:07,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:11:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:11:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:11:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:11:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:11:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:11:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:11:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:11:07,137 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:11:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:11:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:11:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:11:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:11:07,138 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:11:07,139 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:11:07,140 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:11:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:11:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:11:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:11:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:11:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:11:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:11:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:11:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:11:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:11:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:11:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:11:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:11:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:11:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:11:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:11:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:11:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:11:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:11:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:11:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:11:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:11:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:11:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:11:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:11:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:11:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:11:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:11:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:11:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:11:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:11:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:11:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:11:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:11:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:11:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:11:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:11:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:11:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:11:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:11:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:11:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:11:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:11:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:11:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:11:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:11:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:11:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:11:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:11:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:11:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:11:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:11:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:11:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:11:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:11:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:11:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:11:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:11:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:11:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:11:07,773 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:11:07,774 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-15 00:11:07,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:07 BoogieIcfgContainer [2019-10-15 00:11:07,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:11:07,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:11:07,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:11:07,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:11:07,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:11:06" (1/3) ... [2019-10-15 00:11:07,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdc790b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:07, skipping insertion in model container [2019-10-15 00:11:07,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:06" (2/3) ... [2019-10-15 00:11:07,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdc790b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:07, skipping insertion in model container [2019-10-15 00:11:07,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:07" (3/3) ... [2019-10-15 00:11:07,785 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2019-10-15 00:11:07,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:11:07,804 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 00:11:07,816 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 00:11:07,842 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:11:07,843 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:11:07,843 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:11:07,843 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:11:07,843 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:11:07,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:11:07,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:11:07,844 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:11:07,864 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-10-15 00:11:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 00:11:07,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:07,872 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:07,874 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:07,881 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2019-10-15 00:11:07,892 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:07,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504036849] [2019-10-15 00:11:07,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:07,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:07,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:08,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504036849] [2019-10-15 00:11:08,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:08,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 00:11:08,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264615169] [2019-10-15 00:11:08,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:08,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:08,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:08,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:08,104 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-10-15 00:11:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:08,127 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2019-10-15 00:11:08,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:08,128 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-15 00:11:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:08,139 INFO L225 Difference]: With dead ends: 92 [2019-10-15 00:11:08,139 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 00:11:08,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 00:11:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-15 00:11:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 00:11:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-15 00:11:08,194 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2019-10-15 00:11:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:08,194 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-15 00:11:08,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-15 00:11:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 00:11:08,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:08,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:08,196 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2019-10-15 00:11:08,197 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:08,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199690939] [2019-10-15 00:11:08,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:08,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199690939] [2019-10-15 00:11:08,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:08,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:08,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782581429] [2019-10-15 00:11:08,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:08,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:08,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:08,334 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2019-10-15 00:11:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:08,453 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-15 00:11:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:08,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 00:11:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:08,455 INFO L225 Difference]: With dead ends: 43 [2019-10-15 00:11:08,455 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 00:11:08,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 00:11:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-15 00:11:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 00:11:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-15 00:11:08,463 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-10-15 00:11:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:08,464 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-15 00:11:08,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-15 00:11:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 00:11:08,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:08,465 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:08,465 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2019-10-15 00:11:08,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:08,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132379542] [2019-10-15 00:11:08,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:08,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132379542] [2019-10-15 00:11:08,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:08,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:08,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037238126] [2019-10-15 00:11:08,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:08,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:08,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:08,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:08,543 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-10-15 00:11:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:08,629 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-15 00:11:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:08,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 00:11:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:08,632 INFO L225 Difference]: With dead ends: 67 [2019-10-15 00:11:08,632 INFO L226 Difference]: Without dead ends: 65 [2019-10-15 00:11:08,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-15 00:11:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-10-15 00:11:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 00:11:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-15 00:11:08,640 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2019-10-15 00:11:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:08,641 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-15 00:11:08,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-15 00:11:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 00:11:08,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:08,642 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:08,642 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2019-10-15 00:11:08,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:08,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902434758] [2019-10-15 00:11:08,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:08,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902434758] [2019-10-15 00:11:08,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:08,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:08,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078445012] [2019-10-15 00:11:08,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:08,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:08,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:08,719 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2019-10-15 00:11:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:08,819 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-15 00:11:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:11:08,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-15 00:11:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:08,820 INFO L225 Difference]: With dead ends: 39 [2019-10-15 00:11:08,820 INFO L226 Difference]: Without dead ends: 37 [2019-10-15 00:11:08,821 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-15 00:11:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-15 00:11:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-15 00:11:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 00:11:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-15 00:11:08,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2019-10-15 00:11:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:08,827 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-15 00:11:08,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-15 00:11:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 00:11:08,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:08,829 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:08,829 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2019-10-15 00:11:08,830 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:08,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338031745] [2019-10-15 00:11:08,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:09,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338031745] [2019-10-15 00:11:09,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:09,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:09,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353023552] [2019-10-15 00:11:09,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:09,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:09,002 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2019-10-15 00:11:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:09,153 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-10-15 00:11:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:11:09,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-15 00:11:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:09,155 INFO L225 Difference]: With dead ends: 72 [2019-10-15 00:11:09,155 INFO L226 Difference]: Without dead ends: 48 [2019-10-15 00:11:09,156 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-15 00:11:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-15 00:11:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-10-15 00:11:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 00:11:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-15 00:11:09,164 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2019-10-15 00:11:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:09,164 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-15 00:11:09,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-15 00:11:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:11:09,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:09,165 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-15 00:11:09,166 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2019-10-15 00:11:09,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:09,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861629975] [2019-10-15 00:11:09,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:09,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861629975] [2019-10-15 00:11:09,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:09,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:11:09,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201260566] [2019-10-15 00:11:09,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:11:09,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:09,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:11:09,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:11:09,349 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2019-10-15 00:11:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:09,525 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-10-15 00:11:09,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:11:09,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-15 00:11:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:09,526 INFO L225 Difference]: With dead ends: 54 [2019-10-15 00:11:09,527 INFO L226 Difference]: Without dead ends: 52 [2019-10-15 00:11:09,527 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-15 00:11:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-15 00:11:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-10-15 00:11:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-15 00:11:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-15 00:11:09,534 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2019-10-15 00:11:09,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:09,535 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-15 00:11:09,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:11:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-15 00:11:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:11:09,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:09,536 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-15 00:11:09,536 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:09,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:09,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1742673852, now seen corresponding path program 1 times [2019-10-15 00:11:09,537 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:09,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860222059] [2019-10-15 00:11:09,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,711 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-15 00:11:09,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860222059] [2019-10-15 00:11:09,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249783214] [2019-10-15 00:11:09,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-15 00:11:09,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:11:09,977 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-15 00:11:09,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:09,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,002 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-15 00:11:10,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,021 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-15 00:11:10,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-15 00:11:10,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,085 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-15 00:11:10,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,165 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.4 percent of original size [2019-10-15 00:11:10,177 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-15 00:11:10,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:10,231 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-15 00:11:10,232 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:10,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:10,264 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-15 00:11:10,265 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:10,291 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,313 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-15 00:11:10,314 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:109, output treesize:36 [2019-10-15 00:11:10,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,395 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-15 00:11:10,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,444 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-15 00:11:10,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:10,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,502 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-15 00:11:10,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:10,542 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,570 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-15 00:11:10,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,629 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-10-15 00:11:10,630 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-15 00:11:10,631 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,652 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-15 00:11:10,653 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-10-15 00:11:10,703 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-15 00:11:10,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:10,716 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-15 00:11:10,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-15 00:11:10,723 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-15 00:11:10,723 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:11:10,747 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-15 00:11:10,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,882 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-15 00:11:10,883 INFO L567 ElimStorePlain]: treesize reduction 11, result has 95.1 percent of original size [2019-10-15 00:11:10,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:10,992 INFO L567 ElimStorePlain]: treesize reduction 79, result has 54.6 percent of original size [2019-10-15 00:11:10,995 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-15 00:11:11,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:11,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:11,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:11,031 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-15 00:11:11,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:11,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:11,059 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-15 00:11:11,059 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:157, output treesize:157 [2019-10-15 00:11:11,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:11,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:11:13,250 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |v_#memory_int_29|], 10=[|v_#memory_int_30|]} [2019-10-15 00:11:13,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:13,383 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-10-15 00:11:13,383 INFO L567 ElimStorePlain]: treesize reduction 231, result has 38.2 percent of original size [2019-10-15 00:11:13,387 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-15 00:11:13,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:13,411 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-15 00:11:13,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:13,455 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-15 00:11:13,455 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:613, output treesize:191 [2019-10-15 00:11:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:13,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:11:13,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6] total 12 [2019-10-15 00:11:13,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315735629] [2019-10-15 00:11:13,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 00:11:13,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:13,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 00:11:13,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=94, Unknown=1, NotChecked=0, Total=132 [2019-10-15 00:11:13,562 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2019-10-15 00:11:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:29,047 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-10-15 00:11:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:11:29,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-15 00:11:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:29,048 INFO L225 Difference]: With dead ends: 62 [2019-10-15 00:11:29,049 INFO L226 Difference]: Without dead ends: 60 [2019-10-15 00:11:29,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=54, Invalid=154, Unknown=2, NotChecked=0, Total=210 [2019-10-15 00:11:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-15 00:11:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-10-15 00:11:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 00:11:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-15 00:11:29,057 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2019-10-15 00:11:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:29,057 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-15 00:11:29,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 00:11:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-15 00:11:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 00:11:29,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:29,059 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:29,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:29,260 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash 995688324, now seen corresponding path program 1 times [2019-10-15 00:11:29,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:29,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813863502] [2019-10-15 00:11:29,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:29,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:29,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:29,458 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-15 00:11:29,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813863502] [2019-10-15 00:11:29,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973466462] [2019-10-15 00:11:29,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:29,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-15 00:11:29,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:11:29,565 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-15 00:11:29,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:29,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:29,579 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-15 00:11:29,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:29,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:29,589 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-15 00:11:29,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-15 00:11:29,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:29,644 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-15 00:11:29,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:29,734 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.7 percent of original size [2019-10-15 00:11:29,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:29,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:29,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:29,783 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-15 00:11:29,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:29,825 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-15 00:11:29,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:29,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:29,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:29,892 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 1 case distinctions, treesize of input 75 treesize of output 64 [2019-10-15 00:11:29,893 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:29,948 INFO L567 ElimStorePlain]: treesize reduction 18, result has 78.6 percent of original size [2019-10-15 00:11:29,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:29,951 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:112, output treesize:36 [2019-10-15 00:11:30,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,014 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-15 00:11:30,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:30,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,056 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_25|, |v_#memory_int_41|, |v_#memory_int_42|], 10=[|v_#memory_int_44|]} [2019-10-15 00:11:30,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:30,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:30,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:30,105 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:30,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,143 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-15 00:11:30,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,179 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-15 00:11:30,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,228 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-10-15 00:11:30,229 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-15 00:11:30,230 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:30,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,250 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-15 00:11:30,251 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-10-15 00:11:30,308 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-15 00:11:30,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:30,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,317 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-15 00:11:30,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-15 00:11:30,330 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-15 00:11:30,330 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:11:30,363 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_25|, |v_#memory_int_42|], 3=[|v_#memory_int_41|]} [2019-10-15 00:11:30,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:30,484 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-15 00:11:30,485 INFO L567 ElimStorePlain]: treesize reduction 70, result has 58.3 percent of original size [2019-10-15 00:11:30,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:30,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,555 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-15 00:11:30,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:30,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:30,819 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-15 00:11:30,825 INFO L168 Benchmark]: Toolchain (without parser) took 24458.40 ms. Allocated memory was 143.7 MB in the beginning and 275.3 MB in the end (delta: 131.6 MB). Free memory was 100.3 MB in the beginning and 157.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 74.5 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:30,826 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 00:11:30,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.39 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 169.2 MB in the end (delta: -69.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:30,828 INFO L168 Benchmark]: Boogie Preprocessor took 95.52 ms. Allocated memory is still 201.9 MB. Free memory was 169.2 MB in the beginning and 166.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:30,829 INFO L168 Benchmark]: RCFGBuilder took 702.12 ms. Allocated memory is still 201.9 MB. Free memory was 166.0 MB in the beginning and 119.9 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:30,829 INFO L168 Benchmark]: TraceAbstraction took 23046.56 ms. Allocated memory was 201.9 MB in the beginning and 275.3 MB in the end (delta: 73.4 MB). Free memory was 119.2 MB in the beginning and 157.4 MB in the end (delta: -38.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:30,833 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.21 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 608.39 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 169.2 MB in the end (delta: -69.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.52 ms. Allocated memory is still 201.9 MB. Free memory was 169.2 MB in the beginning and 166.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 702.12 ms. Allocated memory is still 201.9 MB. Free memory was 166.0 MB in the beginning and 119.9 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23046.56 ms. Allocated memory was 201.9 MB in the beginning and 275.3 MB in the end (delta: 73.4 MB). Free memory was 119.2 MB in the beginning and 157.4 MB in the end (delta: -38.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...