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/ssh/s3_clnt.blast.04.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:57,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:57,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:57,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:57,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:57,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:57,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:57,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:57,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:57,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:57,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:57,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:57,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:57,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:57,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:57,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:57,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:57,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:57,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:57,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:57,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:57,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:57,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:57,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:57,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:57,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:57,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:57,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:57,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:57,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:57,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:57,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:57,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:57,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:57,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:57,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:57,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:57,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:57,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:57,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:57,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:57,992 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-16 17:04:58,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:58,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:58,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:58,008 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:58,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:58,009 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:58,009 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:58,009 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:58,009 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:58,010 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:58,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:58,011 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:58,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:58,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:58,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:58,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:58,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:58,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:58,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:58,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:58,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:58,013 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:58,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:58,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:58,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:58,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:58,014 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:58,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:58,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:58,014 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:58,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:58,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:58,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:58,064 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:58,064 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:58,065 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-2.c [2019-09-16 17:04:58,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86493eb0/36649f8d3efa48118a5a8e1c7d854541/FLAGadfe546c1 [2019-09-16 17:04:58,755 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:58,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.04.i.cil-2.c [2019-09-16 17:04:58,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86493eb0/36649f8d3efa48118a5a8e1c7d854541/FLAGadfe546c1 [2019-09-16 17:04:59,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b86493eb0/36649f8d3efa48118a5a8e1c7d854541 [2019-09-16 17:04:59,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:59,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:59,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:59,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:59,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:59,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:04:59,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cf5178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59, skipping insertion in model container [2019-09-16 17:04:59,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:04:59,054 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:59,140 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:59,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:59,726 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:59,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:59,954 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:59,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59 WrapperNode [2019-09-16 17:04:59,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:59,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:59,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:59,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:59,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:04:59,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (1/1) ... [2019-09-16 17:05:00,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:05:00,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:05:00,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:05:00,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:05:00,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (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-16 17:05:00,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:05:00,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:05:00,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:05:00,235 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:05:00,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:05:00,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:05:00,236 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:05:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:05:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:05:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:05:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:05:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:05:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:05:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:05:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:05:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:05:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:05:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:05:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:05:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:05:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:05:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:05:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:05:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:05:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:05:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:05:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:05:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:05:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:05:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:05:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:05:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:05:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:05:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:05:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:05:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:05:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:05:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:05:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:05:00,748 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:05:01,418 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:05:01,418 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:05:01,438 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:05:01,439 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:05:01,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:01 BoogieIcfgContainer [2019-09-16 17:05:01,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:05:01,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:05:01,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:05:01,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:05:01,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:59" (1/3) ... [2019-09-16 17:05:01,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c06ee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:01, skipping insertion in model container [2019-09-16 17:05:01,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:59" (2/3) ... [2019-09-16 17:05:01,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c06ee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:05:01, skipping insertion in model container [2019-09-16 17:05:01,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:05:01" (3/3) ... [2019-09-16 17:05:01,449 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2019-09-16 17:05:01,460 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:05:01,469 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:05:01,487 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:05:01,518 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:05:01,519 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:05:01,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:05:01,519 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:05:01,519 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:05:01,519 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:05:01,520 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:05:01,520 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:05:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-16 17:05:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:05:01,561 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,562 INFO L407 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, 1] [2019-09-16 17:05:01,564 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-16 17:05:01,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,958 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-16 17:05:01,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:01,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:01,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:01,984 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-16 17:05:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,142 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-16 17:05:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:02,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:05:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,167 INFO L225 Difference]: With dead ends: 254 [2019-09-16 17:05:02,167 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:05:02,174 INFO L636 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-16 17:05:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:05:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-16 17:05:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-16 17:05:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-16 17:05:02,245 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-16 17:05:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,246 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-16 17:05:02,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-16 17:05:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:05:02,249 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,250 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-09-16 17:05:02,250 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-16 17:05:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:02,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:02,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:02,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:02,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:02,419 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-16 17:05:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,516 INFO L93 Difference]: Finished difference Result 319 states and 470 transitions. [2019-09-16 17:05:02,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:02,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:05:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,521 INFO L225 Difference]: With dead ends: 319 [2019-09-16 17:05:02,521 INFO L226 Difference]: Without dead ends: 319 [2019-09-16 17:05:02,522 INFO L636 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-16 17:05:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-16 17:05:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2019-09-16 17:05:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-16 17:05:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2019-09-16 17:05:02,550 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 45 [2019-09-16 17:05:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,551 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2019-09-16 17:05:02,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2019-09-16 17:05:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:05:02,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,555 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2019-09-16 17:05:02,555 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash -389905176, now seen corresponding path program 1 times [2019-09-16 17:05:02,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:02,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,788 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand 4 states. [2019-09-16 17:05:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,525 INFO L93 Difference]: Finished difference Result 505 states and 747 transitions. [2019-09-16 17:05:03,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:05:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,530 INFO L225 Difference]: With dead ends: 505 [2019-09-16 17:05:03,530 INFO L226 Difference]: Without dead ends: 505 [2019-09-16 17:05:03,530 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-16 17:05:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 369. [2019-09-16 17:05:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-16 17:05:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 556 transitions. [2019-09-16 17:05:03,549 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 556 transitions. Word has length 63 [2019-09-16 17:05:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,550 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 556 transitions. [2019-09-16 17:05:03,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 556 transitions. [2019-09-16 17:05:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:05:03,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,555 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2019-09-16 17:05:03,555 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash -523918682, now seen corresponding path program 1 times [2019-09-16 17:05:03,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,707 INFO L87 Difference]: Start difference. First operand 369 states and 556 transitions. Second operand 4 states. [2019-09-16 17:05:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,052 INFO L93 Difference]: Finished difference Result 455 states and 682 transitions. [2019-09-16 17:05:04,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:05:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,058 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:04,059 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:04,059 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 409. [2019-09-16 17:05:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-09-16 17:05:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 624 transitions. [2019-09-16 17:05:04,075 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 624 transitions. Word has length 63 [2019-09-16 17:05:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,078 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 624 transitions. [2019-09-16 17:05:04,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 624 transitions. [2019-09-16 17:05:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:05:04,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,091 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-09-16 17:05:04,092 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash 793155671, now seen corresponding path program 1 times [2019-09-16 17:05:04,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:04,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,234 INFO L87 Difference]: Start difference. First operand 409 states and 624 transitions. Second operand 4 states. [2019-09-16 17:05:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,724 INFO L93 Difference]: Finished difference Result 537 states and 805 transitions. [2019-09-16 17:05:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:05:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,729 INFO L225 Difference]: With dead ends: 537 [2019-09-16 17:05:04,730 INFO L226 Difference]: Without dead ends: 537 [2019-09-16 17:05:04,730 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-16 17:05:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 411. [2019-09-16 17:05:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 626 transitions. [2019-09-16 17:05:04,750 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 626 transitions. Word has length 64 [2019-09-16 17:05:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,750 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 626 transitions. [2019-09-16 17:05:04,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 626 transitions. [2019-09-16 17:05:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:04,754 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,754 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,755 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1956758784, now seen corresponding path program 1 times [2019-09-16 17:05:04,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:04,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,914 INFO L87 Difference]: Start difference. First operand 411 states and 626 transitions. Second operand 4 states. [2019-09-16 17:05:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,394 INFO L93 Difference]: Finished difference Result 535 states and 801 transitions. [2019-09-16 17:05:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,399 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:05,399 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:05,400 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 624 transitions. [2019-09-16 17:05:05,413 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 624 transitions. Word has length 77 [2019-09-16 17:05:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,413 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 624 transitions. [2019-09-16 17:05:05,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 624 transitions. [2019-09-16 17:05:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:05,416 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,416 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:05,416 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,417 INFO L82 PathProgramCache]: Analyzing trace with hash 847778338, now seen corresponding path program 1 times [2019-09-16 17:05:05,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:05,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,500 INFO L87 Difference]: Start difference. First operand 411 states and 624 transitions. Second operand 4 states. [2019-09-16 17:05:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,921 INFO L93 Difference]: Finished difference Result 535 states and 799 transitions. [2019-09-16 17:05:05,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,925 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:05,925 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:05,926 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 622 transitions. [2019-09-16 17:05:05,937 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 622 transitions. Word has length 77 [2019-09-16 17:05:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,938 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 622 transitions. [2019-09-16 17:05:05,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 622 transitions. [2019-09-16 17:05:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:05,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,940 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:05,940 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,941 INFO L82 PathProgramCache]: Analyzing trace with hash 927399486, now seen corresponding path program 1 times [2019-09-16 17:05:05,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,022 INFO L87 Difference]: Start difference. First operand 411 states and 622 transitions. Second operand 4 states. [2019-09-16 17:05:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,310 INFO L93 Difference]: Finished difference Result 455 states and 676 transitions. [2019-09-16 17:05:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,333 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:06,334 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:06,334 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 620 transitions. [2019-09-16 17:05:06,345 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 620 transitions. Word has length 77 [2019-09-16 17:05:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,345 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 620 transitions. [2019-09-16 17:05:06,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 620 transitions. [2019-09-16 17:05:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:06,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,347 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,348 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash -181580960, now seen corresponding path program 1 times [2019-09-16 17:05:06,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,419 INFO L87 Difference]: Start difference. First operand 411 states and 620 transitions. Second operand 4 states. [2019-09-16 17:05:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,712 INFO L93 Difference]: Finished difference Result 455 states and 674 transitions. [2019-09-16 17:05:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,716 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:06,716 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:06,716 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2019-09-16 17:05:06,727 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 77 [2019-09-16 17:05:06,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,728 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2019-09-16 17:05:06,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2019-09-16 17:05:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:06,730 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,730 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,731 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 565717777, now seen corresponding path program 1 times [2019-09-16 17:05:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,797 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand 4 states. [2019-09-16 17:05:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,254 INFO L93 Difference]: Finished difference Result 535 states and 793 transitions. [2019-09-16 17:05:07,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,259 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:07,259 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:07,260 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2019-09-16 17:05:07,278 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 78 [2019-09-16 17:05:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,278 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2019-09-16 17:05:07,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2019-09-16 17:05:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:07,281 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,282 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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-16 17:05:07,282 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash 865778860, now seen corresponding path program 1 times [2019-09-16 17:05:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:07,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,372 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand 4 states. [2019-09-16 17:05:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,885 INFO L93 Difference]: Finished difference Result 535 states and 791 transitions. [2019-09-16 17:05:07,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,889 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:07,889 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:07,889 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2019-09-16 17:05:07,903 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 78 [2019-09-16 17:05:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,904 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2019-09-16 17:05:07,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2019-09-16 17:05:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:07,906 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,907 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:07,907 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1279649389, now seen corresponding path program 1 times [2019-09-16 17:05:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:07,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,989 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand 4 states. [2019-09-16 17:05:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,309 INFO L93 Difference]: Finished difference Result 455 states and 668 transitions. [2019-09-16 17:05:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,312 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:08,313 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:08,313 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 612 transitions. [2019-09-16 17:05:08,323 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 612 transitions. Word has length 78 [2019-09-16 17:05:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,324 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 612 transitions. [2019-09-16 17:05:08,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 612 transitions. [2019-09-16 17:05:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:08,326 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,326 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 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-16 17:05:08,326 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,326 INFO L82 PathProgramCache]: Analyzing trace with hash -979588306, now seen corresponding path program 1 times [2019-09-16 17:05:08,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:08,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,405 INFO L87 Difference]: Start difference. First operand 411 states and 612 transitions. Second operand 4 states. [2019-09-16 17:05:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,697 INFO L93 Difference]: Finished difference Result 455 states and 666 transitions. [2019-09-16 17:05:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,701 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:08,702 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:08,702 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 610 transitions. [2019-09-16 17:05:08,714 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 610 transitions. Word has length 78 [2019-09-16 17:05:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,714 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 610 transitions. [2019-09-16 17:05:08,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 610 transitions. [2019-09-16 17:05:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:08,716 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,716 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:08,717 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 468355613, now seen corresponding path program 1 times [2019-09-16 17:05:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:08,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,789 INFO L87 Difference]: Start difference. First operand 411 states and 610 transitions. Second operand 4 states. [2019-09-16 17:05:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,275 INFO L93 Difference]: Finished difference Result 535 states and 785 transitions. [2019-09-16 17:05:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:09,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,279 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:05:09,279 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:05:09,280 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:05:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2019-09-16 17:05:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 608 transitions. [2019-09-16 17:05:09,292 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 608 transitions. Word has length 79 [2019-09-16 17:05:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,292 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 608 transitions. [2019-09-16 17:05:09,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 608 transitions. [2019-09-16 17:05:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:09,294 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,295 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1] [2019-09-16 17:05:09,296 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash -821622051, now seen corresponding path program 1 times [2019-09-16 17:05:09,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:09,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:09,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:09,374 INFO L87 Difference]: Start difference. First operand 411 states and 608 transitions. Second operand 4 states. [2019-09-16 17:05:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,893 INFO L93 Difference]: Finished difference Result 529 states and 776 transitions. [2019-09-16 17:05:09,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:09,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,897 INFO L225 Difference]: With dead ends: 529 [2019-09-16 17:05:09,898 INFO L226 Difference]: Without dead ends: 529 [2019-09-16 17:05:09,901 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-16 17:05:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 411. [2019-09-16 17:05:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 606 transitions. [2019-09-16 17:05:09,916 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 606 transitions. Word has length 79 [2019-09-16 17:05:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,917 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 606 transitions. [2019-09-16 17:05:09,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 606 transitions. [2019-09-16 17:05:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:09,920 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,920 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:09,920 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash -903451685, now seen corresponding path program 1 times [2019-09-16 17:05:09,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:10,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,018 INFO L87 Difference]: Start difference. First operand 411 states and 606 transitions. Second operand 4 states. [2019-09-16 17:05:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:10,321 INFO L93 Difference]: Finished difference Result 455 states and 660 transitions. [2019-09-16 17:05:10,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:10,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:10,324 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:05:10,324 INFO L226 Difference]: Without dead ends: 455 [2019-09-16 17:05:10,325 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-16 17:05:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2019-09-16 17:05:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 604 transitions. [2019-09-16 17:05:10,336 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 604 transitions. Word has length 79 [2019-09-16 17:05:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,336 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 604 transitions. [2019-09-16 17:05:10,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 604 transitions. [2019-09-16 17:05:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:10,338 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,338 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1] [2019-09-16 17:05:10,338 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2101537947, now seen corresponding path program 1 times [2019-09-16 17:05:10,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:10,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,432 INFO L87 Difference]: Start difference. First operand 411 states and 604 transitions. Second operand 4 states. [2019-09-16 17:05:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:10,709 INFO L93 Difference]: Finished difference Result 449 states and 651 transitions. [2019-09-16 17:05:10,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:10,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:10,712 INFO L225 Difference]: With dead ends: 449 [2019-09-16 17:05:10,712 INFO L226 Difference]: Without dead ends: 449 [2019-09-16 17:05:10,713 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-16 17:05:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 411. [2019-09-16 17:05:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 602 transitions. [2019-09-16 17:05:10,724 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 602 transitions. Word has length 79 [2019-09-16 17:05:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,724 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 602 transitions. [2019-09-16 17:05:10,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 602 transitions. [2019-09-16 17:05:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:10,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,727 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:10,727 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1801676460, now seen corresponding path program 1 times [2019-09-16 17:05:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:10,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,804 INFO L87 Difference]: Start difference. First operand 411 states and 602 transitions. Second operand 4 states. [2019-09-16 17:05:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,192 INFO L93 Difference]: Finished difference Result 511 states and 748 transitions. [2019-09-16 17:05:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:11,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,196 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:05:11,196 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:05:11,197 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:11,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:05:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-16 17:05:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 600 transitions. [2019-09-16 17:05:11,209 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 600 transitions. Word has length 80 [2019-09-16 17:05:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,209 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 600 transitions. [2019-09-16 17:05:11,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 600 transitions. [2019-09-16 17:05:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:11,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,211 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:11,212 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2069644114, now seen corresponding path program 1 times [2019-09-16 17:05:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:11,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:11,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:11,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:11,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:11,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:11,280 INFO L87 Difference]: Start difference. First operand 411 states and 600 transitions. Second operand 4 states. [2019-09-16 17:05:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,539 INFO L93 Difference]: Finished difference Result 431 states and 625 transitions. [2019-09-16 17:05:11,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:11,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,542 INFO L225 Difference]: With dead ends: 431 [2019-09-16 17:05:11,543 INFO L226 Difference]: Without dead ends: 431 [2019-09-16 17:05:11,543 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-16 17:05:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-09-16 17:05:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2019-09-16 17:05:11,554 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 80 [2019-09-16 17:05:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,554 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2019-09-16 17:05:11,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2019-09-16 17:05:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:11,556 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,556 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2019-09-16 17:05:11,556 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1190699097, now seen corresponding path program 1 times [2019-09-16 17:05:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:11,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:11,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:11,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:11,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:11,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:11,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:11,626 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 4 states. [2019-09-16 17:05:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,111 INFO L93 Difference]: Finished difference Result 511 states and 744 transitions. [2019-09-16 17:05:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:12,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,117 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:05:12,117 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:05:12,118 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:05:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2019-09-16 17:05:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-09-16 17:05:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 596 transitions. [2019-09-16 17:05:12,140 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 596 transitions. Word has length 81 [2019-09-16 17:05:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,140 INFO L475 AbstractCegarLoop]: Abstraction has 411 states and 596 transitions. [2019-09-16 17:05:12,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 596 transitions. [2019-09-16 17:05:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:12,144 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,144 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2019-09-16 17:05:12,144 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1438845591, now seen corresponding path program 1 times [2019-09-16 17:05:12,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 17:05:12,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:12,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:12,255 INFO L87 Difference]: Start difference. First operand 411 states and 596 transitions. Second operand 3 states. [2019-09-16 17:05:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,360 INFO L93 Difference]: Finished difference Result 560 states and 813 transitions. [2019-09-16 17:05:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:12,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 17:05:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,365 INFO L225 Difference]: With dead ends: 560 [2019-09-16 17:05:12,365 INFO L226 Difference]: Without dead ends: 560 [2019-09-16 17:05:12,366 INFO L636 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-16 17:05:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-16 17:05:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-16 17:05:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-16 17:05:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 813 transitions. [2019-09-16 17:05:12,386 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 813 transitions. Word has length 81 [2019-09-16 17:05:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,386 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 813 transitions. [2019-09-16 17:05:12,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 813 transitions. [2019-09-16 17:05:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:12,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,390 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:12,390 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash 181906312, now seen corresponding path program 1 times [2019-09-16 17:05:12,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-16 17:05:12,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:12,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:12,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:12,472 INFO L87 Difference]: Start difference. First operand 560 states and 813 transitions. Second operand 3 states. [2019-09-16 17:05:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,506 INFO L93 Difference]: Finished difference Result 709 states and 1031 transitions. [2019-09-16 17:05:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:12,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:05:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,513 INFO L225 Difference]: With dead ends: 709 [2019-09-16 17:05:12,513 INFO L226 Difference]: Without dead ends: 709 [2019-09-16 17:05:12,514 INFO L636 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-16 17:05:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-16 17:05:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2019-09-16 17:05:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-16 17:05:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1031 transitions. [2019-09-16 17:05:12,530 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1031 transitions. Word has length 83 [2019-09-16 17:05:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,531 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1031 transitions. [2019-09-16 17:05:12,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1031 transitions. [2019-09-16 17:05:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:12,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,533 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:12,534 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1980699707, now seen corresponding path program 1 times [2019-09-16 17:05:12,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:12,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:12,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:12,614 INFO L87 Difference]: Start difference. First operand 709 states and 1031 transitions. Second operand 3 states. [2019-09-16 17:05:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,650 INFO L93 Difference]: Finished difference Result 858 states and 1250 transitions. [2019-09-16 17:05:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:12,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:05:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,655 INFO L225 Difference]: With dead ends: 858 [2019-09-16 17:05:12,656 INFO L226 Difference]: Without dead ends: 858 [2019-09-16 17:05:12,656 INFO L636 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-16 17:05:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-09-16 17:05:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2019-09-16 17:05:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-16 17:05:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1250 transitions. [2019-09-16 17:05:12,674 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1250 transitions. Word has length 104 [2019-09-16 17:05:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,674 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1250 transitions. [2019-09-16 17:05:12,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1250 transitions. [2019-09-16 17:05:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-16 17:05:12,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,678 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:12,678 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1640086875, now seen corresponding path program 1 times [2019-09-16 17:05:12,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-16 17:05:12,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:12,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:12,776 INFO L87 Difference]: Start difference. First operand 858 states and 1250 transitions. Second operand 4 states. [2019-09-16 17:05:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:13,066 INFO L93 Difference]: Finished difference Result 1143 states and 1671 transitions. [2019-09-16 17:05:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:13,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-16 17:05:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:13,073 INFO L225 Difference]: With dead ends: 1143 [2019-09-16 17:05:13,073 INFO L226 Difference]: Without dead ends: 1143 [2019-09-16 17:05:13,073 INFO L636 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-16 17:05:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2019-09-16 17:05:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 990. [2019-09-16 17:05:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-09-16 17:05:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1478 transitions. [2019-09-16 17:05:13,095 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1478 transitions. Word has length 125 [2019-09-16 17:05:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:13,096 INFO L475 AbstractCegarLoop]: Abstraction has 990 states and 1478 transitions. [2019-09-16 17:05:13,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1478 transitions. [2019-09-16 17:05:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-16 17:05:13,099 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:13,099 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:13,099 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:13,100 INFO L82 PathProgramCache]: Analyzing trace with hash -884198403, now seen corresponding path program 1 times [2019-09-16 17:05:13,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 124 proven. 11 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-16 17:05:13,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:05:13,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:05:13,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2019-09-16 17:05:13,205 INFO L207 CegarAbsIntRunner]: [0], [38], [39], [40], [43], [52], [63], [72], [74], [77], [79], [84], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [242], [244], [247], [251], [256], [271], [277], [282], [284], [287], [295], [298], [303], [306], [314], [319], [321], [323], [328], [331], [333], [336], [344], [346], [348], [351], [359], [364], [366], [369], [523], [557], [559], [571], [590], [596], [597], [598] [2019-09-16 17:05:13,276 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:05:13,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:05:13,369 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:05:13,370 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:05:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:13,375 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:05:13,438 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:05:13,438 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:05:13,443 INFO L420 sIntCurrentIteration]: We unified 138 AI predicates to 138 [2019-09-16 17:05:13,443 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:05:13,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:05:13,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-16 17:05:13,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:13,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:05:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:05:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:13,446 INFO L87 Difference]: Start difference. First operand 990 states and 1478 transitions. Second operand 2 states. [2019-09-16 17:05:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:13,446 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:05:13,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:05:13,447 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 139 [2019-09-16 17:05:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:13,447 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:05:13,447 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:13,447 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-16 17:05:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:13,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2019-09-16 17:05:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:13,449 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:13,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:05:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:13,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:13,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:13 BoogieIcfgContainer [2019-09-16 17:05:13,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:13,457 INFO L168 Benchmark]: Toolchain (without parser) took 14420.36 ms. Allocated memory was 137.9 MB in the beginning and 400.0 MB in the end (delta: 262.1 MB). Free memory was 83.1 MB in the beginning and 130.4 MB in the end (delta: -47.3 MB). Peak memory consumption was 214.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,458 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 918.15 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 82.9 MB in the beginning and 155.0 MB in the end (delta: -72.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,460 INFO L168 Benchmark]: Boogie Preprocessor took 199.47 ms. Allocated memory is still 198.2 MB. Free memory was 155.0 MB in the beginning and 147.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,461 INFO L168 Benchmark]: RCFGBuilder took 1284.83 ms. Allocated memory was 198.2 MB in the beginning and 218.1 MB in the end (delta: 19.9 MB). Free memory was 147.7 MB in the beginning and 169.2 MB in the end (delta: -21.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,461 INFO L168 Benchmark]: TraceAbstraction took 12012.71 ms. Allocated memory was 218.1 MB in the beginning and 400.0 MB in the end (delta: 181.9 MB). Free memory was 169.2 MB in the beginning and 130.4 MB in the end (delta: 38.8 MB). Peak memory consumption was 220.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:13,465 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.28 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 918.15 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 82.9 MB in the beginning and 155.0 MB in the end (delta: -72.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 199.47 ms. Allocated memory is still 198.2 MB. Free memory was 155.0 MB in the beginning and 147.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1284.83 ms. Allocated memory was 198.2 MB in the beginning and 218.1 MB in the end (delta: 19.9 MB). Free memory was 147.7 MB in the beginning and 169.2 MB in the end (delta: -21.5 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12012.71 ms. Allocated memory was 218.1 MB in the beginning and 400.0 MB in the end (delta: 181.9 MB). Free memory was 169.2 MB in the beginning and 130.4 MB in the end (delta: 38.8 MB). Peak memory consumption was 220.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1643]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. SAFE Result, 11.9s OverallTime, 25 OverallIterations, 7 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5258 SDtfs, 2021 SDslu, 6728 SDs, 0 SdLazy, 3676 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 186 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=990occurred in iteration=24, 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, 1.0 AbsIntWeakeningRatio, 1.4565217391304348 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 1677 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1974 NumberOfCodeBlocks, 1974 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1949 ConstructedInterpolants, 0 QuantifiedInterpolants, 406715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 24 PerfectInterpolantSequences, 1564/1575 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...