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/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:47:13,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:47:13,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:47:13,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:47:13,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:47:13,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:47:13,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:47:13,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:47:13,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:47:13,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:47:13,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:47:13,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:47:13,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:47:13,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:47:13,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:47:13,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:47:13,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:47:13,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:47:13,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:47:13,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:47:13,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:47:13,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:47:13,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:47:13,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:47:13,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:47:13,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:47:13,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:47:13,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:47:13,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:47:13,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:47:13,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:47:13,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:47:13,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:47:13,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:47:13,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:47:13,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:47:13,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:47:13,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:47:13,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:47:13,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:47:13,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:47:13,353 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-09-10 01:47:13,389 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:47:13,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:47:13,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:47:13,393 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:47:13,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:47:13,394 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:47:13,394 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:47:13,395 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:47:13,395 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:47:13,395 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:47:13,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:47:13,397 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:47:13,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:47:13,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:47:13,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:47:13,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:47:13,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:47:13,398 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:47:13,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:47:13,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:47:13,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:47:13,400 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:47:13,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:47:13,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:47:13,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:47:13,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:47:13,401 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:47:13,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:47:13,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:47:13,402 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:47:13,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:47:13,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:47:13,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:47:13,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:47:13,478 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:47:13,479 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-09-10 01:47:13,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7749ae989/6f739e4ba59a40c99c784c1d7b22d6ff/FLAGe6824d038 [2019-09-10 01:47:14,128 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:47:14,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-09-10 01:47:14,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7749ae989/6f739e4ba59a40c99c784c1d7b22d6ff/FLAGe6824d038 [2019-09-10 01:47:14,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7749ae989/6f739e4ba59a40c99c784c1d7b22d6ff [2019-09-10 01:47:14,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:47:14,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:47:14,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:47:14,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:47:14,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:47:14,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:47:14" (1/1) ... [2019-09-10 01:47:14,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194b4a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:14, skipping insertion in model container [2019-09-10 01:47:14,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:47:14" (1/1) ... [2019-09-10 01:47:14,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:47:14,462 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:47:14,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:47:14,902 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:47:14,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:47:15,002 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:47:15,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15 WrapperNode [2019-09-10 01:47:15,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:47:15,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:47:15,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:47:15,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:47:15,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:47:15,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:47:15,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:47:15,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:47:15,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (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-09-10 01:47:15,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:47:15,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:47:15,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:47:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-10 01:47:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-10 01:47:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-10 01:47:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-10 01:47:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-10 01:47:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-10 01:47:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-10 01:47:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-10 01:47:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-10 01:47:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-10 01:47:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-10 01:47:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-10 01:47:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-10 01:47:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-10 01:47:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-10 01:47:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-10 01:47:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-10 01:47:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-10 01:47:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-10 01:47:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-10 01:47:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-10 01:47:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-10 01:47:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-10 01:47:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-10 01:47:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-10 01:47:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-10 01:47:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-10 01:47:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-10 01:47:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-10 01:47:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-10 01:47:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-10 01:47:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-10 01:47:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-10 01:47:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-10 01:47:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-10 01:47:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-10 01:47:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-10 01:47:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-10 01:47:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-10 01:47:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-10 01:47:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-10 01:47:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-10 01:47:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-10 01:47:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-10 01:47:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-10 01:47:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-10 01:47:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-10 01:47:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-10 01:47:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-10 01:47:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-10 01:47:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 01:47:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-10 01:47:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-10 01:47:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 01:47:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-10 01:47:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-10 01:47:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-10 01:47:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-10 01:47:15,158 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-10 01:47:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-10 01:47:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-10 01:47:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-10 01:47:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-10 01:47:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 01:47:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-10 01:47:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-10 01:47:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-10 01:47:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-10 01:47:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-10 01:47:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-10 01:47:15,160 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-10 01:47:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-10 01:47:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-10 01:47:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-10 01:47:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-10 01:47:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-10 01:47:15,161 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-10 01:47:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-10 01:47:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-10 01:47:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-10 01:47:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-10 01:47:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-10 01:47:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-10 01:47:15,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-10 01:47:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-10 01:47:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-10 01:47:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-10 01:47:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-10 01:47:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-10 01:47:15,163 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-10 01:47:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-10 01:47:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-10 01:47:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-10 01:47:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-10 01:47:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-10 01:47:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-10 01:47:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 01:47:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:47:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:47:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 01:47:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 01:47:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 01:47:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 01:47:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:47:15,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:47:15,818 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:47:15,818 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-10 01:47:15,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:47:15 BoogieIcfgContainer [2019-09-10 01:47:15,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:47:15,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:47:15,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:47:15,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:47:15,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:47:14" (1/3) ... [2019-09-10 01:47:15,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181586c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:47:15, skipping insertion in model container [2019-09-10 01:47:15,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (2/3) ... [2019-09-10 01:47:15,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181586c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:47:15, skipping insertion in model container [2019-09-10 01:47:15,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:47:15" (3/3) ... [2019-09-10 01:47:15,828 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-09-10 01:47:15,839 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:47:15,848 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-10 01:47:15,865 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-10 01:47:15,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:47:15,888 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:47:15,888 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:47:15,889 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:47:15,889 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:47:15,889 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:47:15,889 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:47:15,890 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:47:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-09-10 01:47:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-10 01:47:15,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:15,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:15,924 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash -22945038, now seen corresponding path program 1 times [2019-09-10 01:47:15,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:15,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:15,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:15,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:15,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:16,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:16,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:16,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:16,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:16,132 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-09-10 01:47:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:16,219 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2019-09-10 01:47:16,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:16,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-10 01:47:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:16,237 INFO L225 Difference]: With dead ends: 90 [2019-09-10 01:47:16,238 INFO L226 Difference]: Without dead ends: 85 [2019-09-10 01:47:16,241 INFO L628 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-09-10 01:47:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-10 01:47:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2019-09-10 01:47:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 01:47:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-10 01:47:16,279 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 8 [2019-09-10 01:47:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:16,280 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-10 01:47:16,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-10 01:47:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:47:16,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,281 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,281 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 902725328, now seen corresponding path program 1 times [2019-09-10 01:47:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:16,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:16,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:16,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:16,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:16,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:16,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:16,365 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 4 states. [2019-09-10 01:47:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:16,528 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2019-09-10 01:47:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:16,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 01:47:16,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:16,534 INFO L225 Difference]: With dead ends: 117 [2019-09-10 01:47:16,534 INFO L226 Difference]: Without dead ends: 117 [2019-09-10 01:47:16,537 INFO L628 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-09-10 01:47:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-10 01:47:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2019-09-10 01:47:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 01:47:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-09-10 01:47:16,555 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 13 [2019-09-10 01:47:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:16,556 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-09-10 01:47:16,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-09-10 01:47:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:47:16,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,557 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash 902727250, now seen corresponding path program 1 times [2019-09-10 01:47:16,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:16,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:16,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:16,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:16,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:16,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:16,654 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-09-10 01:47:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:16,782 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-09-10 01:47:16,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:47:16,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 01:47:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:16,784 INFO L225 Difference]: With dead ends: 116 [2019-09-10 01:47:16,784 INFO L226 Difference]: Without dead ends: 116 [2019-09-10 01:47:16,785 INFO L628 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-09-10 01:47:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-10 01:47:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2019-09-10 01:47:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-10 01:47:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-09-10 01:47:16,793 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 13 [2019-09-10 01:47:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:16,793 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-09-10 01:47:16,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-09-10 01:47:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:47:16,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,795 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,796 INFO L82 PathProgramCache]: Analyzing trace with hash 904574292, now seen corresponding path program 1 times [2019-09-10 01:47:16,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:16,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-09-10 01:47:16,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:16,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:16,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:16,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:16,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:16,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:16,869 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-09-10 01:47:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:16,944 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2019-09-10 01:47:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:16,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 01:47:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:16,946 INFO L225 Difference]: With dead ends: 71 [2019-09-10 01:47:16,946 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 01:47:16,949 INFO L628 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-09-10 01:47:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 01:47:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-10 01:47:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 01:47:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2019-09-10 01:47:16,959 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 13 [2019-09-10 01:47:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:16,961 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2019-09-10 01:47:16,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2019-09-10 01:47:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:47:16,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,963 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 443005780, now seen corresponding path program 1 times [2019-09-10 01:47:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:17,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:17,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,050 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 3 states. [2019-09-10 01:47:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,099 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2019-09-10 01:47:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:17,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-10 01:47:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,101 INFO L225 Difference]: With dead ends: 68 [2019-09-10 01:47:17,101 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 01:47:17,101 INFO L628 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-09-10 01:47:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 01:47:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-10 01:47:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 01:47:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-09-10 01:47:17,112 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 17 [2019-09-10 01:47:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,113 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-09-10 01:47:17,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-09-10 01:47:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:47:17,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:17,115 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash 848281492, now seen corresponding path program 1 times [2019-09-10 01:47:17,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:47:17,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:47:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:47:17,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:17,164 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2019-09-10 01:47:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,264 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-09-10 01:47:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:17,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 01:47:17,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,266 INFO L225 Difference]: With dead ends: 97 [2019-09-10 01:47:17,266 INFO L226 Difference]: Without dead ends: 97 [2019-09-10 01:47:17,266 INFO L628 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-09-10 01:47:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-10 01:47:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 64. [2019-09-10 01:47:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-10 01:47:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-09-10 01:47:17,272 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 18 [2019-09-10 01:47:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,272 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-09-10 01:47:17,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:47:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-09-10 01:47:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:47:17,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,273 INFO L399 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-09-10 01:47:17,274 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash -423078347, now seen corresponding path program 1 times [2019-09-10 01:47:17,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:17,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:17,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,307 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2019-09-10 01:47:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,319 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-09-10 01:47:17,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:17,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-10 01:47:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,320 INFO L225 Difference]: With dead ends: 84 [2019-09-10 01:47:17,320 INFO L226 Difference]: Without dead ends: 84 [2019-09-10 01:47:17,321 INFO L628 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-09-10 01:47:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-10 01:47:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-09-10 01:47:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 01:47:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-09-10 01:47:17,326 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 21 [2019-09-10 01:47:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,326 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-09-10 01:47:17,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-09-10 01:47:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:47:17,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,328 INFO L399 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-09-10 01:47:17,328 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash -230531371, now seen corresponding path program 1 times [2019-09-10 01:47:17,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:17,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,369 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 3 states. [2019-09-10 01:47:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,383 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-09-10 01:47:17,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:17,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-10 01:47:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,385 INFO L225 Difference]: With dead ends: 65 [2019-09-10 01:47:17,385 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 01:47:17,386 INFO L628 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-09-10 01:47:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 01:47:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-10 01:47:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 01:47:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-09-10 01:47:17,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 22 [2019-09-10 01:47:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,400 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-09-10 01:47:17,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-09-10 01:47:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:47:17,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,404 INFO L399 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-09-10 01:47:17,404 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,405 INFO L82 PathProgramCache]: Analyzing trace with hash -740876651, now seen corresponding path program 1 times [2019-09-10 01:47:17,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:17,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:17,476 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 4 states. [2019-09-10 01:47:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,547 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-09-10 01:47:17,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:17,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-10 01:47:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,549 INFO L225 Difference]: With dead ends: 64 [2019-09-10 01:47:17,549 INFO L226 Difference]: Without dead ends: 64 [2019-09-10 01:47:17,549 INFO L628 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-09-10 01:47:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-10 01:47:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-10 01:47:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 01:47:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-09-10 01:47:17,553 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 23 [2019-09-10 01:47:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,553 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-09-10 01:47:17,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2019-09-10 01:47:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:47:17,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,555 INFO L399 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-09-10 01:47:17,556 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1797790752, now seen corresponding path program 1 times [2019-09-10 01:47:17,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:47:17,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:47:17,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:47:17,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:17,654 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 5 states. [2019-09-10 01:47:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,891 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2019-09-10 01:47:17,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:47:17,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-10 01:47:17,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,892 INFO L225 Difference]: With dead ends: 114 [2019-09-10 01:47:17,893 INFO L226 Difference]: Without dead ends: 114 [2019-09-10 01:47:17,893 INFO L628 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-09-10 01:47:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-10 01:47:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2019-09-10 01:47:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 01:47:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-09-10 01:47:17,897 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 24 [2019-09-10 01:47:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,897 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-09-10 01:47:17,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:47:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-09-10 01:47:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:47:17,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,899 INFO L399 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-09-10 01:47:17,899 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1787839648, now seen corresponding path program 1 times [2019-09-10 01:47:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:18,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:18,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 01:47:18,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:18,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:47:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:47:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:47:18,348 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 10 states. [2019-09-10 01:47:18,659 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 01:47:19,218 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 01:47:19,353 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 01:47:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:19,617 INFO L93 Difference]: Finished difference Result 226 states and 256 transitions. [2019-09-10 01:47:19,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:47:19,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-10 01:47:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:19,619 INFO L225 Difference]: With dead ends: 226 [2019-09-10 01:47:19,619 INFO L226 Difference]: Without dead ends: 226 [2019-09-10 01:47:19,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:47:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-10 01:47:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 83. [2019-09-10 01:47:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-10 01:47:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-09-10 01:47:19,625 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 24 [2019-09-10 01:47:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:19,626 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-09-10 01:47:19,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:47:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-09-10 01:47:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:47:19,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:19,627 INFO L399 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-09-10 01:47:19,628 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 776722398, now seen corresponding path program 1 times [2019-09-10 01:47:19,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:19,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:19,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:47:19,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:19,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:47:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:47:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:19,673 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 5 states. [2019-09-10 01:47:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:19,823 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2019-09-10 01:47:19,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:47:19,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-09-10 01:47:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:19,824 INFO L225 Difference]: With dead ends: 135 [2019-09-10 01:47:19,825 INFO L226 Difference]: Without dead ends: 135 [2019-09-10 01:47:19,825 INFO L628 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-09-10 01:47:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-10 01:47:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2019-09-10 01:47:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 01:47:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-09-10 01:47:19,829 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 24 [2019-09-10 01:47:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:19,829 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-09-10 01:47:19,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:47:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-09-10 01:47:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:47:19,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:19,830 INFO L399 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-09-10 01:47:19,831 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash -766212324, now seen corresponding path program 1 times [2019-09-10 01:47:19,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:19,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:19,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:19,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:19,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:19,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:19,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:19,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:19,870 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 4 states. [2019-09-10 01:47:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:19,959 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2019-09-10 01:47:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:47:19,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-09-10 01:47:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:19,961 INFO L225 Difference]: With dead ends: 104 [2019-09-10 01:47:19,961 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 01:47:19,962 INFO L628 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-09-10 01:47:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 01:47:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2019-09-10 01:47:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 01:47:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2019-09-10 01:47:19,966 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 26 [2019-09-10 01:47:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:19,967 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2019-09-10 01:47:19,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2019-09-10 01:47:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:47:19,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:19,968 INFO L399 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-09-10 01:47:19,968 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1739288676, now seen corresponding path program 1 times [2019-09-10 01:47:19,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:19,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:19,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:20,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:20,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:20,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:20,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:20,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:20,004 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 3 states. [2019-09-10 01:47:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:20,035 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2019-09-10 01:47:20,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:20,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-10 01:47:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:20,036 INFO L225 Difference]: With dead ends: 94 [2019-09-10 01:47:20,036 INFO L226 Difference]: Without dead ends: 94 [2019-09-10 01:47:20,037 INFO L628 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-09-10 01:47:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-10 01:47:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-10 01:47:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-10 01:47:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-09-10 01:47:20,040 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 26 [2019-09-10 01:47:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:20,040 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-09-10 01:47:20,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-09-10 01:47:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:47:20,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:20,042 INFO L399 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-09-10 01:47:20,042 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash 127122795, now seen corresponding path program 1 times [2019-09-10 01:47:20,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:20,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:20,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:20,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:20,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 01:47:20,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:20,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:47:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:47:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:47:20,426 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 11 states. [2019-09-10 01:47:21,111 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 01:47:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:21,249 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2019-09-10 01:47:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:47:21,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-09-10 01:47:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:21,252 INFO L225 Difference]: With dead ends: 162 [2019-09-10 01:47:21,252 INFO L226 Difference]: Without dead ends: 162 [2019-09-10 01:47:21,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:47:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-10 01:47:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2019-09-10 01:47:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 01:47:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2019-09-10 01:47:21,257 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 26 [2019-09-10 01:47:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:21,257 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2019-09-10 01:47:21,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:47:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2019-09-10 01:47:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:47:21,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:21,258 INFO L399 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-09-10 01:47:21,259 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1457864297, now seen corresponding path program 1 times [2019-09-10 01:47:21,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:21,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:21,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:21,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:21,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:47:21,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:21,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:47:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:47:21,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:21,319 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 5 states. [2019-09-10 01:47:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:21,486 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2019-09-10 01:47:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:47:21,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-10 01:47:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:21,488 INFO L225 Difference]: With dead ends: 117 [2019-09-10 01:47:21,488 INFO L226 Difference]: Without dead ends: 117 [2019-09-10 01:47:21,489 INFO L628 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-09-10 01:47:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-10 01:47:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2019-09-10 01:47:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-10 01:47:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-09-10 01:47:21,497 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 28 [2019-09-10 01:47:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:21,498 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-09-10 01:47:21,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:47:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-09-10 01:47:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:47:21,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:21,499 INFO L399 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-09-10 01:47:21,500 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -713997721, now seen corresponding path program 1 times [2019-09-10 01:47:21,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:21,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:21,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:21,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:21,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 01:47:21,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:21,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:47:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:47:21,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:47:21,695 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 8 states. [2019-09-10 01:47:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:21,962 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2019-09-10 01:47:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:47:21,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-10 01:47:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:21,964 INFO L225 Difference]: With dead ends: 133 [2019-09-10 01:47:21,964 INFO L226 Difference]: Without dead ends: 133 [2019-09-10 01:47:21,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:47:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-10 01:47:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2019-09-10 01:47:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 01:47:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2019-09-10 01:47:21,969 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2019-09-10 01:47:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:21,970 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2019-09-10 01:47:21,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:47:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2019-09-10 01:47:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 01:47:21,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:21,971 INFO L399 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-09-10 01:47:21,971 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1038087272, now seen corresponding path program 1 times [2019-09-10 01:47:21,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:22,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:22,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:22,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:22,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:22,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:22,003 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 3 states. [2019-09-10 01:47:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:22,014 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2019-09-10 01:47:22,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:22,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-10 01:47:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:22,016 INFO L225 Difference]: With dead ends: 135 [2019-09-10 01:47:22,016 INFO L226 Difference]: Without dead ends: 135 [2019-09-10 01:47:22,016 INFO L628 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-09-10 01:47:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-10 01:47:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2019-09-10 01:47:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-10 01:47:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-09-10 01:47:22,021 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 29 [2019-09-10 01:47:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:22,021 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-09-10 01:47:22,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-09-10 01:47:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 01:47:22,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:22,023 INFO L399 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-09-10 01:47:22,023 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash 584602460, now seen corresponding path program 1 times [2019-09-10 01:47:22,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:22,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:22,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:22,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:22,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:47:22,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:47:22,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-10 01:47:22,126 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-09-10 01:47:22,184 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:47:22,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:47:22,259 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 01:47:22,260 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-09-10 01:47:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:22,265 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 01:47:22,307 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-10 01:47:22,307 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 01:47:22,309 INFO L420 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2019-09-10 01:47:22,309 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 01:47:22,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:47:22,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 01:47:22,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:22,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:47:22,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:47:22,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:47:22,311 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 2 states. [2019-09-10 01:47:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:22,312 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-10 01:47:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:47:22,312 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-09-10 01:47:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:22,312 INFO L225 Difference]: With dead ends: 6 [2019-09-10 01:47:22,312 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:47:22,313 INFO L628 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-09-10 01:47:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:47:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:47:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:47:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:47:22,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-09-10 01:47:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:22,314 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:47:22,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:47:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:47:22,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:47:22,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:47:22 BoogieIcfgContainer [2019-09-10 01:47:22,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:47:22,320 INFO L168 Benchmark]: Toolchain (without parser) took 7936.18 ms. Allocated memory was 132.1 MB in the beginning and 324.5 MB in the end (delta: 192.4 MB). Free memory was 86.9 MB in the beginning and 280.4 MB in the end (delta: -193.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:47:22,321 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:47:22,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.13 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 86.7 MB in the beginning and 163.4 MB in the end (delta: -76.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:22,323 INFO L168 Benchmark]: Boogie Preprocessor took 80.05 ms. Allocated memory is still 198.7 MB. Free memory was 163.4 MB in the beginning and 159.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:22,324 INFO L168 Benchmark]: RCFGBuilder took 736.28 ms. Allocated memory is still 198.7 MB. Free memory was 159.8 MB in the beginning and 103.8 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:22,325 INFO L168 Benchmark]: TraceAbstraction took 6497.61 ms. Allocated memory was 198.7 MB in the beginning and 324.5 MB in the end (delta: 125.8 MB). Free memory was 103.8 MB in the beginning and 280.4 MB in the end (delta: -176.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:47:22,328 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.25 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 618.13 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 86.7 MB in the beginning and 163.4 MB in the end (delta: -76.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.05 ms. Allocated memory is still 198.7 MB. Free memory was 163.4 MB in the beginning and 159.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 736.28 ms. Allocated memory is still 198.7 MB. Free memory was 159.8 MB in the beginning and 103.8 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6497.61 ms. Allocated memory was 198.7 MB in the beginning and 324.5 MB in the end (delta: 125.8 MB). Free memory was 103.8 MB in the beginning and 280.4 MB in the end (delta: -176.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1004]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1042]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1041]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1043]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1026]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: 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 - 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, 6.4s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1159 SDtfs, 1616 SDslu, 1784 SDs, 0 SdLazy, 1189 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=18, 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, 19 MinimizatonAttempts, 551 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 71957 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 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...