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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 22:16:46,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 22:16:46,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 22:16:46,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 22:16:46,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 22:16:46,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 22:16:46,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 22:16:46,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 22:16:46,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 22:16:46,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 22:16:46,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 22:16:46,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 22:16:46,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 22:16:46,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 22:16:46,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 22:16:46,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 22:16:46,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 22:16:46,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 22:16:46,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 22:16:46,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 22:16:46,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 22:16:46,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 22:16:46,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 22:16:46,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 22:16:46,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 22:16:46,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 22:16:46,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 22:16:46,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 22:16:46,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 22:16:46,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 22:16:46,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 22:16:46,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 22:16:46,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 22:16:46,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 22:16:46,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 22:16:46,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 22:16:46,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 22:16:46,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 22:16:46,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 22:16:46,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 22:16:46,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 22:16:46,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 22:16:46,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 22:16:46,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 22:16:46,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 22:16:46,306 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 22:16:46,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 22:16:46,307 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 22:16:46,307 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 22:16:46,308 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 22:16:46,308 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 22:16:46,308 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 22:16:46,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 22:16:46,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 22:16:46,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 22:16:46,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 22:16:46,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 22:16:46,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 22:16:46,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 22:16:46,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 22:16:46,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 22:16:46,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 22:16:46,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 22:16:46,311 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 22:16:46,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 22:16:46,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 22:16:46,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 22:16:46,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 22:16:46,312 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 22:16:46,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 22:16:46,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 22:16:46,313 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 22:16:46,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 22:16:46,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 22:16:46,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 22:16:46,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 22:16:46,363 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 22:16:46,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-02 22:16:46,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbb2e476/69fcc93cecdf405bbd6a57d124ad62f2/FLAG03f4d0a99 [2019-10-02 22:16:46,942 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 22:16:46,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-02 22:16:46,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbb2e476/69fcc93cecdf405bbd6a57d124ad62f2/FLAG03f4d0a99 [2019-10-02 22:16:47,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbb2e476/69fcc93cecdf405bbd6a57d124ad62f2 [2019-10-02 22:16:47,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 22:16:47,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 22:16:47,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 22:16:47,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 22:16:47,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 22:16:47,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:47,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11498c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47, skipping insertion in model container [2019-10-02 22:16:47,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:47,298 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 22:16:47,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 22:16:47,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 22:16:47,868 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 22:16:47,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 22:16:47,966 INFO L192 MainTranslator]: Completed translation [2019-10-02 22:16:47,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47 WrapperNode [2019-10-02 22:16:47,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 22:16:47,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 22:16:47,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 22:16:47,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 22:16:47,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:47,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:47,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:48,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:48,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:48,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:48,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... [2019-10-02 22:16:48,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 22:16:48,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 22:16:48,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 22:16:48,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 22:16:48,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 22:16:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 22:16:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 22:16:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 22:16:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 22:16:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 22:16:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 22:16:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 22:16:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 22:16:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 22:16:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 22:16:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 22:16:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 22:16:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 22:16:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 22:16:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 22:16:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 22:16:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 22:16:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 22:16:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 22:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 22:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 22:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 22:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 22:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 22:16:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 22:16:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 22:16:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 22:16:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 22:16:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 22:16:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 22:16:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 22:16:48,114 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 22:16:48,114 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 22:16:48,114 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 22:16:48,114 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 22:16:48,114 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 22:16:48,114 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 22:16:48,114 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 22:16:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 22:16:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 22:16:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 22:16:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 22:16:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 22:16:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 22:16:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 22:16:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 22:16:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 22:16:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 22:16:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 22:16:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 22:16:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 22:16:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 22:16:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 22:16:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 22:16:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 22:16:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 22:16:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 22:16:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 22:16:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 22:16:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 22:16:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 22:16:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 22:16:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 22:16:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 22:16:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 22:16:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 22:16:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 22:16:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 22:16:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 22:16:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 22:16:48,119 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 22:16:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 22:16:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 22:16:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 22:16:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 22:16:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 22:16:48,120 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 22:16:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 22:16:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 22:16:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 22:16:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 22:16:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 22:16:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 22:16:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 22:16:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 22:16:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 22:16:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 22:16:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 22:16:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 22:16:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 22:16:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 22:16:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 22:16:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 22:16:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 22:16:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 22:16:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 22:16:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 22:16:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 22:16:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 22:16:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 22:16:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 22:16:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 22:16:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 22:16:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 22:16:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 22:16:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 22:16:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 22:16:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 22:16:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 22:16:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 22:16:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 22:16:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 22:16:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 22:16:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 22:16:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 22:16:48,881 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 22:16:48,882 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-02 22:16:48,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:16:48 BoogieIcfgContainer [2019-10-02 22:16:48,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 22:16:48,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 22:16:48,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 22:16:48,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 22:16:48,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:16:47" (1/3) ... [2019-10-02 22:16:48,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45303911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:16:48, skipping insertion in model container [2019-10-02 22:16:48,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:16:47" (2/3) ... [2019-10-02 22:16:48,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45303911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:16:48, skipping insertion in model container [2019-10-02 22:16:48,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:16:48" (3/3) ... [2019-10-02 22:16:48,891 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-10-02 22:16:48,902 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 22:16:48,914 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-02 22:16:48,932 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-02 22:16:48,965 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 22:16:48,965 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 22:16:48,965 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 22:16:48,966 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 22:16:48,966 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 22:16:48,966 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 22:16:48,967 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 22:16:48,967 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 22:16:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-10-02 22:16:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-02 22:16:49,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:49,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:49,003 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash -22945038, now seen corresponding path program 1 times [2019-10-02 22:16:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:49,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:49,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:49,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:49,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 22:16:49,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:49,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 22:16:49,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 22:16:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:49,207 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-10-02 22:16:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:49,276 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2019-10-02 22:16:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 22:16:49,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-02 22:16:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:49,289 INFO L225 Difference]: With dead ends: 90 [2019-10-02 22:16:49,289 INFO L226 Difference]: Without dead ends: 85 [2019-10-02 22:16:49,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-02 22:16:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2019-10-02 22:16:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-02 22:16:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-10-02 22:16:49,336 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 8 [2019-10-02 22:16:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:49,337 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-10-02 22:16:49,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 22:16:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-10-02 22:16:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 22:16:49,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:49,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:49,360 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash 902725328, now seen corresponding path program 1 times [2019-10-02 22:16:49,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:49,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:49,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 22:16:49,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:49,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 22:16:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 22:16:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 22:16:49,464 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 4 states. [2019-10-02 22:16:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:49,602 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2019-10-02 22:16:49,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 22:16:49,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-02 22:16:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:49,606 INFO L225 Difference]: With dead ends: 117 [2019-10-02 22:16:49,607 INFO L226 Difference]: Without dead ends: 117 [2019-10-02 22:16:49,607 INFO L640 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-02 22:16:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-02 22:16:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2019-10-02 22:16:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-02 22:16:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-10-02 22:16:49,617 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 13 [2019-10-02 22:16:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:49,618 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-10-02 22:16:49,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 22:16:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-10-02 22:16:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 22:16:49,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:49,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:49,620 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 902727250, now seen corresponding path program 1 times [2019-10-02 22:16:49,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:49,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:49,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:49,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 22:16:49,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:49,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 22:16:49,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 22:16:49,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 22:16:49,672 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-10-02 22:16:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:49,802 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-10-02 22:16:49,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 22:16:49,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-02 22:16:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:49,804 INFO L225 Difference]: With dead ends: 116 [2019-10-02 22:16:49,804 INFO L226 Difference]: Without dead ends: 116 [2019-10-02 22:16:49,804 INFO L640 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-02 22:16:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-02 22:16:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2019-10-02 22:16:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-02 22:16:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-10-02 22:16:49,811 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 13 [2019-10-02 22:16:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:49,812 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-10-02 22:16:49,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 22:16:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-10-02 22:16:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 22:16:49,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:49,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:49,813 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 904574292, now seen corresponding path program 1 times [2019-10-02 22:16:49,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:49,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:49,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:49,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 22:16:49,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:49,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 22:16:49,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 22:16:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 22:16:49,881 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-10-02 22:16:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:49,966 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-10-02 22:16:49,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 22:16:49,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-02 22:16:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:49,968 INFO L225 Difference]: With dead ends: 72 [2019-10-02 22:16:49,968 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 22:16:49,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 22:16:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 22:16:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-02 22:16:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-02 22:16:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-10-02 22:16:49,980 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 13 [2019-10-02 22:16:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:49,981 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-10-02 22:16:49,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 22:16:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-10-02 22:16:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 22:16:49,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:49,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:49,984 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 443005780, now seen corresponding path program 1 times [2019-10-02 22:16:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:49,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:50,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:50,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 22:16:50,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:50,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 22:16:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 22:16:50,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 22:16:50,123 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 5 states. [2019-10-02 22:16:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:50,251 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-10-02 22:16:50,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 22:16:50,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 22:16:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:50,253 INFO L225 Difference]: With dead ends: 102 [2019-10-02 22:16:50,253 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 22:16:50,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 22:16:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 22:16:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 66. [2019-10-02 22:16:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 22:16:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-10-02 22:16:50,264 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 17 [2019-10-02 22:16:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:50,264 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-10-02 22:16:50,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 22:16:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-10-02 22:16:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 22:16:50,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:50,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:50,266 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash 848281492, now seen corresponding path program 1 times [2019-10-02 22:16:50,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:50,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:50,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:50,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:50,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 22:16:50,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:50,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 22:16:50,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 22:16:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 22:16:50,337 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2019-10-02 22:16:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:50,428 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-10-02 22:16:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 22:16:50,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 22:16:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:50,429 INFO L225 Difference]: With dead ends: 97 [2019-10-02 22:16:50,429 INFO L226 Difference]: Without dead ends: 97 [2019-10-02 22:16:50,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 22:16:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-02 22:16:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 64. [2019-10-02 22:16:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 22:16:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-10-02 22:16:50,434 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 18 [2019-10-02 22:16:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:50,435 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-10-02 22:16:50,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 22:16:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-10-02 22:16:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 22:16:50,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:50,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:50,436 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:50,437 INFO L82 PathProgramCache]: Analyzing trace with hash -423078347, now seen corresponding path program 1 times [2019-10-02 22:16:50,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:50,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:50,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:50,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:50,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 22:16:50,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:50,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 22:16:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 22:16:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:50,470 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2019-10-02 22:16:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:50,488 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-10-02 22:16:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 22:16:50,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 22:16:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:50,490 INFO L225 Difference]: With dead ends: 84 [2019-10-02 22:16:50,490 INFO L226 Difference]: Without dead ends: 84 [2019-10-02 22:16:50,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-02 22:16:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-10-02 22:16:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 22:16:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-10-02 22:16:50,499 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 21 [2019-10-02 22:16:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:50,499 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-10-02 22:16:50,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 22:16:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-10-02 22:16:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 22:16:50,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:50,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:50,504 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -230531371, now seen corresponding path program 1 times [2019-10-02 22:16:50,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:50,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:50,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 22:16:50,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:50,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 22:16:50,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 22:16:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:50,570 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 3 states. [2019-10-02 22:16:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:50,585 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-10-02 22:16:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 22:16:50,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 22:16:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:50,586 INFO L225 Difference]: With dead ends: 65 [2019-10-02 22:16:50,587 INFO L226 Difference]: Without dead ends: 65 [2019-10-02 22:16:50,587 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-02 22:16:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-10-02 22:16:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 22:16:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-10-02 22:16:50,594 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 22 [2019-10-02 22:16:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:50,594 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-10-02 22:16:50,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 22:16:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-10-02 22:16:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 22:16:50,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:50,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:50,597 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash -740876651, now seen corresponding path program 1 times [2019-10-02 22:16:50,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:50,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:50,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:50,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:50,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 22:16:50,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:50,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 22:16:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 22:16:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 22:16:50,675 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 4 states. [2019-10-02 22:16:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:50,772 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-10-02 22:16:50,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 22:16:50,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-02 22:16:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:50,774 INFO L225 Difference]: With dead ends: 64 [2019-10-02 22:16:50,774 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 22:16:50,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 22:16:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 22:16:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-02 22:16:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 22:16:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-10-02 22:16:50,779 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 23 [2019-10-02 22:16:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:50,779 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-10-02 22:16:50,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 22:16:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-10-02 22:16:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 22:16:50,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:50,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:50,782 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:50,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1797790752, now seen corresponding path program 1 times [2019-10-02 22:16:50,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:50,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:50,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:50,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 22:16:50,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:50,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 22:16:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 22:16:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 22:16:50,867 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 5 states. [2019-10-02 22:16:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:51,056 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2019-10-02 22:16:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 22:16:51,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-02 22:16:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:51,057 INFO L225 Difference]: With dead ends: 114 [2019-10-02 22:16:51,057 INFO L226 Difference]: Without dead ends: 114 [2019-10-02 22:16:51,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 22:16:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-02 22:16:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2019-10-02 22:16:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 22:16:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-10-02 22:16:51,061 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 24 [2019-10-02 22:16:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:51,062 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-10-02 22:16:51,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 22:16:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-10-02 22:16:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 22:16:51,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:51,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:51,064 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:51,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1787839648, now seen corresponding path program 1 times [2019-10-02 22:16:51,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:51,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:51,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:51,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 22:16:51,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:51,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 22:16:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 22:16:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 22:16:51,194 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 7 states. [2019-10-02 22:16:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:51,812 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2019-10-02 22:16:51,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 22:16:51,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-02 22:16:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:51,814 INFO L225 Difference]: With dead ends: 184 [2019-10-02 22:16:51,814 INFO L226 Difference]: Without dead ends: 184 [2019-10-02 22:16:51,815 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-02 22:16:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-02 22:16:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 80. [2019-10-02 22:16:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-02 22:16:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2019-10-02 22:16:51,819 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 24 [2019-10-02 22:16:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:51,820 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2019-10-02 22:16:51,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 22:16:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2019-10-02 22:16:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 22:16:51,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:51,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:51,822 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:51,822 INFO L82 PathProgramCache]: Analyzing trace with hash -766212324, now seen corresponding path program 1 times [2019-10-02 22:16:51,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:51,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:51,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:51,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:51,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 22:16:51,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:51,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 22:16:51,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 22:16:51,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 22:16:51,866 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand 4 states. [2019-10-02 22:16:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:51,998 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-10-02 22:16:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 22:16:51,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-02 22:16:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:51,999 INFO L225 Difference]: With dead ends: 105 [2019-10-02 22:16:52,000 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 22:16:52,000 INFO L640 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-02 22:16:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 22:16:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-10-02 22:16:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 22:16:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2019-10-02 22:16:52,008 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 26 [2019-10-02 22:16:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:52,008 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2019-10-02 22:16:52,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 22:16:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2019-10-02 22:16:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 22:16:52,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:52,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:52,010 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1739288676, now seen corresponding path program 1 times [2019-10-02 22:16:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:52,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:52,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:52,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:52,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 22:16:52,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:52,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 22:16:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 22:16:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:52,039 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand 3 states. [2019-10-02 22:16:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:52,074 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2019-10-02 22:16:52,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 22:16:52,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 22:16:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:52,076 INFO L225 Difference]: With dead ends: 95 [2019-10-02 22:16:52,076 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 22:16:52,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 22:16:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-10-02 22:16:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 22:16:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2019-10-02 22:16:52,080 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 26 [2019-10-02 22:16:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:52,080 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2019-10-02 22:16:52,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 22:16:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2019-10-02 22:16:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 22:16:52,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:52,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:52,082 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:52,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash 127122795, now seen corresponding path program 1 times [2019-10-02 22:16:52,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:52,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:52,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 22:16:52,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:52,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 22:16:52,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 22:16:52,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-02 22:16:52,201 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 8 states. [2019-10-02 22:16:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:52,715 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2019-10-02 22:16:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 22:16:52,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-10-02 22:16:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:52,717 INFO L225 Difference]: With dead ends: 188 [2019-10-02 22:16:52,717 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 22:16:52,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-02 22:16:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 22:16:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 96. [2019-10-02 22:16:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 22:16:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2019-10-02 22:16:52,722 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 26 [2019-10-02 22:16:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:52,723 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2019-10-02 22:16:52,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 22:16:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2019-10-02 22:16:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 22:16:52,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:52,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:52,724 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:52,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:52,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1457864297, now seen corresponding path program 1 times [2019-10-02 22:16:52,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:52,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:52,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 22:16:52,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:52,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 22:16:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 22:16:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 22:16:52,794 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand 5 states. [2019-10-02 22:16:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:52,944 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2019-10-02 22:16:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 22:16:52,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-02 22:16:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:52,946 INFO L225 Difference]: With dead ends: 119 [2019-10-02 22:16:52,946 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 22:16:52,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 22:16:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 22:16:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2019-10-02 22:16:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-02 22:16:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2019-10-02 22:16:52,950 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 28 [2019-10-02 22:16:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:52,950 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2019-10-02 22:16:52,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 22:16:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2019-10-02 22:16:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 22:16:52,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:52,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:52,952 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash -713997721, now seen corresponding path program 1 times [2019-10-02 22:16:52,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:52,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:52,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:53,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:53,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 22:16:53,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:53,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 22:16:53,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 22:16:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 22:16:53,054 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 6 states. [2019-10-02 22:16:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:53,301 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2019-10-02 22:16:53,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 22:16:53,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-02 22:16:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:53,303 INFO L225 Difference]: With dead ends: 133 [2019-10-02 22:16:53,303 INFO L226 Difference]: Without dead ends: 133 [2019-10-02 22:16:53,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-02 22:16:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-02 22:16:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2019-10-02 22:16:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 22:16:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2019-10-02 22:16:53,309 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 28 [2019-10-02 22:16:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:53,309 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2019-10-02 22:16:53,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 22:16:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2019-10-02 22:16:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 22:16:53,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:53,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:53,310 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:53,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1038087272, now seen corresponding path program 1 times [2019-10-02 22:16:53,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:53,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:53,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 22:16:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 22:16:53,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:53,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 22:16:53,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 22:16:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:53,349 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 3 states. [2019-10-02 22:16:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:53,359 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2019-10-02 22:16:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 22:16:53,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 22:16:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:53,360 INFO L225 Difference]: With dead ends: 135 [2019-10-02 22:16:53,360 INFO L226 Difference]: Without dead ends: 135 [2019-10-02 22:16:53,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 22:16:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-02 22:16:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2019-10-02 22:16:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-02 22:16:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2019-10-02 22:16:53,365 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 29 [2019-10-02 22:16:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:53,365 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2019-10-02 22:16:53,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 22:16:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2019-10-02 22:16:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 22:16:53,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 22:16:53,366 INFO L411 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 22:16:53,367 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 22:16:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:53,367 INFO L82 PathProgramCache]: Analyzing trace with hash 584602460, now seen corresponding path program 1 times [2019-10-02 22:16:53,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 22:16:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 22:16:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 22:16:53,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 22:16:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 22:16:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 22:16:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 22:16:53,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 22:16:53,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-10-02 22:16:53,451 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [24], [30], [35], [43], [57], [60], [132], [142], [156], [165], [239], [259], [262], [272], [283], [286], [287], [319], [321], [327], [328], [351], [364], [368], [369], [370] [2019-10-02 22:16:53,490 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 22:16:53,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 22:16:53,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 22:16:53,546 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 17 root evaluator evaluations with a maximum evaluation depth of 0. Performed 17 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 40 variables. [2019-10-02 22:16:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 22:16:53,550 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 22:16:53,583 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-02 22:16:53,583 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 22:16:53,585 INFO L420 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2019-10-02 22:16:53,585 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 22:16:53,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 22:16:53,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-02 22:16:53,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 22:16:53,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 22:16:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 22:16:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 22:16:53,587 INFO L87 Difference]: Start difference. First operand 113 states and 136 transitions. Second operand 2 states. [2019-10-02 22:16:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 22:16:53,588 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-10-02 22:16:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 22:16:53,588 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-10-02 22:16:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 22:16:53,589 INFO L225 Difference]: With dead ends: 6 [2019-10-02 22:16:53,589 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 22:16:53,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 22:16:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 22:16:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 22:16:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 22:16:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 22:16:53,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-10-02 22:16:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 22:16:53,590 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 22:16:53,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 22:16:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 22:16:53,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 22:16:53,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 10:16:53 BoogieIcfgContainer [2019-10-02 22:16:53,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 22:16:53,598 INFO L168 Benchmark]: Toolchain (without parser) took 6313.75 ms. Allocated memory was 132.6 MB in the beginning and 313.0 MB in the end (delta: 180.4 MB). Free memory was 86.8 MB in the beginning and 214.4 MB in the end (delta: -127.6 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-10-02 22:16:53,599 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 22:16:53,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.22 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 86.6 MB in the beginning and 163.6 MB in the end (delta: -77.0 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2019-10-02 22:16:53,601 INFO L168 Benchmark]: Boogie Preprocessor took 75.44 ms. Allocated memory is still 199.8 MB. Free memory was 163.6 MB in the beginning and 160.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-02 22:16:53,601 INFO L168 Benchmark]: RCFGBuilder took 839.49 ms. Allocated memory is still 199.8 MB. Free memory was 160.3 MB in the beginning and 102.4 MB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. [2019-10-02 22:16:53,602 INFO L168 Benchmark]: TraceAbstraction took 4711.56 ms. Allocated memory was 199.8 MB in the beginning and 313.0 MB in the end (delta: 113.2 MB). Free memory was 101.7 MB in the beginning and 214.4 MB in the end (delta: -112.6 MB). Peak memory consumption was 604.4 kB. Max. memory is 7.1 GB. [2019-10-02 22:16:53,606 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 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 683.22 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 86.6 MB in the beginning and 163.6 MB in the end (delta: -77.0 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.44 ms. Allocated memory is still 199.8 MB. Free memory was 163.6 MB in the beginning and 160.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.49 ms. Allocated memory is still 199.8 MB. Free memory was 160.3 MB in the beginning and 102.4 MB in the end (delta: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4711.56 ms. Allocated memory was 199.8 MB in the beginning and 313.0 MB in the end (delta: 113.2 MB). Free memory was 101.7 MB in the beginning and 214.4 MB in the end (delta: -112.6 MB). Peak memory consumption was 604.4 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1007]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1015]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 995]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1028]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1032]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1045]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1008]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 995]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1029]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1046]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1008]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1027]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1044]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. SAFE Result, 4.6s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1087 SDtfs, 1296 SDslu, 1729 SDs, 0 SdLazy, 1200 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9666666666666667 AbsIntWeakeningRatio, 1.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 0.2 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 522 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 63459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...