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.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:00,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:00,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:00,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:00,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:00,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:00,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:00,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:00,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:00,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:00,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:00,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:00,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:00,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:00,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:00,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:00,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:00,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:00,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:00,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:00,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:00,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:00,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:00,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:00,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:00,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:00,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:00,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:00,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:00,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:00,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:00,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:00,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:00,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:00,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:00,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:00,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:00,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:00,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:00,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:00,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:00,743 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-20 13:27:00,769 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:00,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:00,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:00,770 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:00,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:00,772 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:00,772 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:00,773 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:00,773 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:00,773 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:00,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:00,775 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:00,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:00,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:00,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:00,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:00,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:00,776 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:00,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:00,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:00,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:00,777 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:00,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:00,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:00,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:00,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:00,779 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:00,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:00,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:00,779 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:00,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:00,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:00,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:00,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:00,843 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:00,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-2.c [2019-09-20 13:27:00,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395f24e63/967a12619dfb480d910aa7449291da4a/FLAGc60db73da [2019-09-20 13:27:01,537 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:01,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.01.i.cil-2.c [2019-09-20 13:27:01,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395f24e63/967a12619dfb480d910aa7449291da4a/FLAGc60db73da [2019-09-20 13:27:01,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395f24e63/967a12619dfb480d910aa7449291da4a [2019-09-20 13:27:01,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:01,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:01,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:01,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:01,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:01,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:01" (1/1) ... [2019-09-20 13:27:01,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f296037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:01, skipping insertion in model container [2019-09-20 13:27:01,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:01" (1/1) ... [2019-09-20 13:27:01,789 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:01,870 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:02,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:02,548 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:02,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:02,795 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:02,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02 WrapperNode [2019-09-20 13:27:02,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:02,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:02,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:02,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:02,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (1/1) ... [2019-09-20 13:27:02,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (1/1) ... [2019-09-20 13:27:02,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (1/1) ... [2019-09-20 13:27:02,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (1/1) ... [2019-09-20 13:27:02,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (1/1) ... [2019-09-20 13:27:02,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (1/1) ... [2019-09-20 13:27:02,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (1/1) ... [2019-09-20 13:27:02,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:02,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:02,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:02,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:02,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (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-20 13:27:02,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:02,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-20 13:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-20 13:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-20 13:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:03,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:03,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:03,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:03,001 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:03,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-20 13:27:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-20 13:27:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-20 13:27:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:03,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:03,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:03,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:03,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:03,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:03,577 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:04,226 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-20 13:27:04,227 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-20 13:27:04,251 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:04,251 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:04,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:04 BoogieIcfgContainer [2019-09-20 13:27:04,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:04,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:04,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:04,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:04,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:01" (1/3) ... [2019-09-20 13:27:04,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55eb43df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:04, skipping insertion in model container [2019-09-20 13:27:04,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:02" (2/3) ... [2019-09-20 13:27:04,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55eb43df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:04, skipping insertion in model container [2019-09-20 13:27:04,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:04" (3/3) ... [2019-09-20 13:27:04,261 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-09-20 13:27:04,272 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:04,284 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:04,301 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:04,331 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:04,331 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:04,332 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:04,332 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:04,332 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:04,332 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:04,332 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:04,332 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-20 13:27:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:27:04,368 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:04,369 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-20 13:27:04,371 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:04,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1412419194, now seen corresponding path program 1 times [2019-09-20 13:27:04,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:04,770 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-20 13:27:04,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:04,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:04,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:04,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:04,797 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-20 13:27:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:04,894 INFO L93 Difference]: Finished difference Result 258 states and 416 transitions. [2019-09-20 13:27:04,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:04,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:27:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:04,914 INFO L225 Difference]: With dead ends: 258 [2019-09-20 13:27:04,915 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:04,923 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-20 13:27:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-09-20 13:27:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-20 13:27:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2019-09-20 13:27:05,048 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2019-09-20 13:27:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:05,050 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2019-09-20 13:27:05,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2019-09-20 13:27:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:27:05,063 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:05,063 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-20 13:27:05,064 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash -512814518, now seen corresponding path program 1 times [2019-09-20 13:27:05,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:05,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:05,260 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-20 13:27:05,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:05,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:05,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:05,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:05,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:05,263 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2019-09-20 13:27:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:05,352 INFO L93 Difference]: Finished difference Result 325 states and 476 transitions. [2019-09-20 13:27:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:05,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:27:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,356 INFO L225 Difference]: With dead ends: 325 [2019-09-20 13:27:05,356 INFO L226 Difference]: Without dead ends: 325 [2019-09-20 13:27:05,357 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-20 13:27:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-20 13:27:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-09-20 13:27:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-20 13:27:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2019-09-20 13:27:05,377 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2019-09-20 13:27:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:05,378 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2019-09-20 13:27:05,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2019-09-20 13:27:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:05,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:05,382 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-20 13:27:05,382 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1986020414, now seen corresponding path program 1 times [2019-09-20 13:27:05,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:05,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:05,533 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-20 13:27:05,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:05,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:05,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:05,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:05,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:05,535 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2019-09-20 13:27:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:06,144 INFO L93 Difference]: Finished difference Result 513 states and 755 transitions. [2019-09-20 13:27:06,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:06,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:06,149 INFO L225 Difference]: With dead ends: 513 [2019-09-20 13:27:06,149 INFO L226 Difference]: Without dead ends: 513 [2019-09-20 13:27:06,150 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-20 13:27:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-20 13:27:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2019-09-20 13:27:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-20 13:27:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2019-09-20 13:27:06,194 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2019-09-20 13:27:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:06,194 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2019-09-20 13:27:06,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2019-09-20 13:27:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:06,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:06,203 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-20 13:27:06,203 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2120033920, now seen corresponding path program 1 times [2019-09-20 13:27:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:06,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:06,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:06,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:06,324 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-20 13:27:06,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:06,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:06,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:06,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:06,326 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2019-09-20 13:27:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:06,674 INFO L93 Difference]: Finished difference Result 459 states and 685 transitions. [2019-09-20 13:27:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:06,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:06,678 INFO L225 Difference]: With dead ends: 459 [2019-09-20 13:27:06,678 INFO L226 Difference]: Without dead ends: 459 [2019-09-20 13:27:06,678 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-20 13:27:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-20 13:27:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2019-09-20 13:27:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-20 13:27:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2019-09-20 13:27:06,694 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2019-09-20 13:27:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:06,695 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2019-09-20 13:27:06,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2019-09-20 13:27:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:06,698 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:06,698 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-20 13:27:06,698 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:06,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1441508551, now seen corresponding path program 1 times [2019-09-20 13:27:06,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:06,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:06,858 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-20 13:27:06,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:06,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:06,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:06,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:06,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:06,862 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2019-09-20 13:27:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:07,508 INFO L93 Difference]: Finished difference Result 547 states and 814 transitions. [2019-09-20 13:27:07,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:07,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:07,518 INFO L225 Difference]: With dead ends: 547 [2019-09-20 13:27:07,518 INFO L226 Difference]: Without dead ends: 547 [2019-09-20 13:27:07,519 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-20 13:27:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-20 13:27:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2019-09-20 13:27:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:27:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2019-09-20 13:27:07,541 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2019-09-20 13:27:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:07,542 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2019-09-20 13:27:07,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2019-09-20 13:27:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:07,545 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:07,546 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, 1] [2019-09-20 13:27:07,546 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1741349123, now seen corresponding path program 1 times [2019-09-20 13:27:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:07,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:07,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:07,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:07,674 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-20 13:27:07,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:07,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:07,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:07,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:07,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:07,676 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2019-09-20 13:27:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,148 INFO L93 Difference]: Finished difference Result 547 states and 812 transitions. [2019-09-20 13:27:08,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:08,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,153 INFO L225 Difference]: With dead ends: 547 [2019-09-20 13:27:08,153 INFO L226 Difference]: Without dead ends: 547 [2019-09-20 13:27:08,153 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-20 13:27:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-20 13:27:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2019-09-20 13:27:08,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-20 13:27:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-20 13:27:08,166 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2019-09-20 13:27:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,167 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-20 13:27:08,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-20 13:27:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:08,168 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,168 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, 1, 1] [2019-09-20 13:27:08,169 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1848274964, now seen corresponding path program 1 times [2019-09-20 13:27:08,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,250 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-20 13:27:08,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:08,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:08,253 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-20 13:27:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,729 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2019-09-20 13:27:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:08,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,733 INFO L225 Difference]: With dead ends: 537 [2019-09-20 13:27:08,733 INFO L226 Difference]: Without dead ends: 537 [2019-09-20 13:27:08,734 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-20 13:27:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-20 13:27:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2019-09-20 13:27:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2019-09-20 13:27:08,745 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2019-09-20 13:27:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,746 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2019-09-20 13:27:08,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2019-09-20 13:27:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:08,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,748 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, 1] [2019-09-20 13:27:08,748 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2132058447, now seen corresponding path program 1 times [2019-09-20 13:27:08,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,843 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-20 13:27:08,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:08,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:08,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:08,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:08,845 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2019-09-20 13:27:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,288 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2019-09-20 13:27:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:09,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,292 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:09,292 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:09,293 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-20 13:27:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:27:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2019-09-20 13:27:09,306 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2019-09-20 13:27:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,306 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2019-09-20 13:27:09,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2019-09-20 13:27:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:09,308 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,309 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, 1] [2019-09-20 13:27:09,309 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2113402989, now seen corresponding path program 1 times [2019-09-20 13:27:09,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:09,395 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-20 13:27:09,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:09,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:09,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:09,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:09,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:09,397 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2019-09-20 13:27:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:09,914 INFO L93 Difference]: Finished difference Result 535 states and 792 transitions. [2019-09-20 13:27:09,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:09,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:09,917 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:09,918 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:09,918 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-20 13:27:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:27:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2019-09-20 13:27:09,932 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2019-09-20 13:27:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:09,932 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2019-09-20 13:27:09,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2019-09-20 13:27:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:09,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:09,934 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-20 13:27:09,935 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:09,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1407902352, now seen corresponding path program 1 times [2019-09-20 13:27:09,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:09,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:09,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,007 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-20 13:27:10,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,009 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2019-09-20 13:27:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,467 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2019-09-20 13:27:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,471 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:10,472 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:10,472 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-20 13:27:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:27:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2019-09-20 13:27:10,485 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2019-09-20 13:27:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,486 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2019-09-20 13:27:10,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2019-09-20 13:27:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:10,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,488 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, 1] [2019-09-20 13:27:10,488 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash 286691281, now seen corresponding path program 1 times [2019-09-20 13:27:10,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,589 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-20 13:27:10,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:10,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:10,591 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2019-09-20 13:27:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,906 INFO L93 Difference]: Finished difference Result 463 states and 681 transitions. [2019-09-20 13:27:10,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:10,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:10,910 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:27:10,911 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:27:10,912 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-20 13:27:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:27:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:27:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2019-09-20 13:27:10,923 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2019-09-20 13:27:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,923 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2019-09-20 13:27:10,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2019-09-20 13:27:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:10,925 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,925 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, 1] [2019-09-20 13:27:10,925 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash 268035823, now seen corresponding path program 1 times [2019-09-20 13:27:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,012 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-20 13:27:11,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,014 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2019-09-20 13:27:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,309 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2019-09-20 13:27:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,312 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:27:11,312 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:27:11,312 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-20 13:27:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:27:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:27:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2019-09-20 13:27:11,323 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2019-09-20 13:27:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,323 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2019-09-20 13:27:11,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2019-09-20 13:27:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:27:11,325 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,325 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-20 13:27:11,326 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash -437464814, now seen corresponding path program 1 times [2019-09-20 13:27:11,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,398 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-20 13:27:11,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,400 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2019-09-20 13:27:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,718 INFO L93 Difference]: Finished difference Result 463 states and 677 transitions. [2019-09-20 13:27:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:11,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:27:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,721 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:27:11,721 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:27:11,722 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-20 13:27:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:27:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:27:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2019-09-20 13:27:11,732 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2019-09-20 13:27:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,732 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2019-09-20 13:27:11,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2019-09-20 13:27:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:11,734 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,734 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, 1] [2019-09-20 13:27:11,734 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1076828074, now seen corresponding path program 1 times [2019-09-20 13:27:11,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,794 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-20 13:27:11,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:11,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:11,796 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2019-09-20 13:27:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,246 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2019-09-20 13:27:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,250 INFO L225 Difference]: With dead ends: 535 [2019-09-20 13:27:12,250 INFO L226 Difference]: Without dead ends: 535 [2019-09-20 13:27:12,251 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-20 13:27:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-20 13:27:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2019-09-20 13:27:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-09-20 13:27:12,261 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2019-09-20 13:27:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,261 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-09-20 13:27:12,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-09-20 13:27:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:12,263 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,263 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-20 13:27:12,263 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 979180473, now seen corresponding path program 1 times [2019-09-20 13:27:12,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,326 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-20 13:27:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,328 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-09-20 13:27:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:12,749 INFO L93 Difference]: Finished difference Result 529 states and 773 transitions. [2019-09-20 13:27:12,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:12,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:12,754 INFO L225 Difference]: With dead ends: 529 [2019-09-20 13:27:12,754 INFO L226 Difference]: Without dead ends: 529 [2019-09-20 13:27:12,755 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-20 13:27:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-20 13:27:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-20 13:27:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2019-09-20 13:27:12,765 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2019-09-20 13:27:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:12,766 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2019-09-20 13:27:12,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2019-09-20 13:27:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:12,767 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:12,768 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, 1] [2019-09-20 13:27:12,768 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:12,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:12,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1846331924, now seen corresponding path program 1 times [2019-09-20 13:27:12,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:12,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:12,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:12,827 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-20 13:27:12,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:12,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:12,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:12,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:12,829 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2019-09-20 13:27:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,200 INFO L93 Difference]: Finished difference Result 463 states and 671 transitions. [2019-09-20 13:27:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,203 INFO L225 Difference]: With dead ends: 463 [2019-09-20 13:27:13,204 INFO L226 Difference]: Without dead ends: 463 [2019-09-20 13:27:13,204 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-20 13:27:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-20 13:27:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2019-09-20 13:27:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2019-09-20 13:27:13,214 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2019-09-20 13:27:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,215 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2019-09-20 13:27:13,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2019-09-20 13:27:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:13,217 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,217 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-20 13:27:13,217 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -392626825, now seen corresponding path program 1 times [2019-09-20 13:27:13,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,284 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-20 13:27:13,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,286 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2019-09-20 13:27:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:13,549 INFO L93 Difference]: Finished difference Result 457 states and 662 transitions. [2019-09-20 13:27:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:13,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:13,553 INFO L225 Difference]: With dead ends: 457 [2019-09-20 13:27:13,553 INFO L226 Difference]: Without dead ends: 457 [2019-09-20 13:27:13,554 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-20 13:27:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-20 13:27:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-20 13:27:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2019-09-20 13:27:13,563 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2019-09-20 13:27:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:13,564 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2019-09-20 13:27:13,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2019-09-20 13:27:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:13,565 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:13,566 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, 1] [2019-09-20 13:27:13,566 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash 564256466, now seen corresponding path program 1 times [2019-09-20 13:27:13,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:13,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:13,630 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-20 13:27:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:13,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:13,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:13,632 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2019-09-20 13:27:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,035 INFO L93 Difference]: Finished difference Result 529 states and 767 transitions. [2019-09-20 13:27:14,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:14,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,039 INFO L225 Difference]: With dead ends: 529 [2019-09-20 13:27:14,039 INFO L226 Difference]: Without dead ends: 529 [2019-09-20 13:27:14,040 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-20 13:27:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-20 13:27:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2019-09-20 13:27:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2019-09-20 13:27:14,051 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2019-09-20 13:27:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,052 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2019-09-20 13:27:14,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2019-09-20 13:27:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:14,054 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,074 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, 1] [2019-09-20 13:27:14,075 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 987903188, now seen corresponding path program 1 times [2019-09-20 13:27:14,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,138 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-20 13:27:14,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,142 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2019-09-20 13:27:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,431 INFO L93 Difference]: Finished difference Result 457 states and 658 transitions. [2019-09-20 13:27:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,434 INFO L225 Difference]: With dead ends: 457 [2019-09-20 13:27:14,434 INFO L226 Difference]: Without dead ends: 457 [2019-09-20 13:27:14,435 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-20 13:27:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-20 13:27:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2019-09-20 13:27:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2019-09-20 13:27:14,446 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2019-09-20 13:27:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,447 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2019-09-20 13:27:14,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2019-09-20 13:27:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:14,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,452 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, 1] [2019-09-20 13:27:14,452 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1652269339, now seen corresponding path program 1 times [2019-09-20 13:27:14,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,528 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-20 13:27:14,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,530 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2019-09-20 13:27:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:14,910 INFO L93 Difference]: Finished difference Result 511 states and 741 transitions. [2019-09-20 13:27:14,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:14,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:14,913 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:27:14,913 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:27:14,914 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-20 13:27:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:27:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-20 13:27:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2019-09-20 13:27:14,924 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2019-09-20 13:27:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:14,924 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2019-09-20 13:27:14,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2019-09-20 13:27:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:14,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:14,927 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-20 13:27:14,927 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash -39157652, now seen corresponding path program 1 times [2019-09-20 13:27:14,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:14,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:14,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:14,994 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-20 13:27:14,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:14,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:14,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:14,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:14,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:14,996 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2019-09-20 13:27:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,351 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2019-09-20 13:27:15,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,355 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:27:15,355 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:27:15,355 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-20 13:27:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:27:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2019-09-20 13:27:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2019-09-20 13:27:15,364 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2019-09-20 13:27:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,364 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2019-09-20 13:27:15,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2019-09-20 13:27:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:15,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,366 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, 1] [2019-09-20 13:27:15,366 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1900415833, now seen corresponding path program 1 times [2019-09-20 13:27:15,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,427 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-20 13:27:15,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:15,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:15,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:15,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:15,428 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2019-09-20 13:27:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,708 INFO L93 Difference]: Finished difference Result 439 states and 630 transitions. [2019-09-20 13:27:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:15,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,712 INFO L225 Difference]: With dead ends: 439 [2019-09-20 13:27:15,713 INFO L226 Difference]: Without dead ends: 439 [2019-09-20 13:27:15,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-20 13:27:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-20 13:27:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2019-09-20 13:27:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:27:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2019-09-20 13:27:15,725 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2019-09-20 13:27:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,725 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2019-09-20 13:27:15,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2019-09-20 13:27:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:15,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,728 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-20 13:27:15,728 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 208988842, now seen corresponding path program 1 times [2019-09-20 13:27:15,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,856 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-20 13:27:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:15,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:15,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:15,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:15,858 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2019-09-20 13:27:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:15,888 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2019-09-20 13:27:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:15,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-20 13:27:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:15,892 INFO L225 Difference]: With dead ends: 574 [2019-09-20 13:27:15,892 INFO L226 Difference]: Without dead ends: 574 [2019-09-20 13:27:15,893 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-20 13:27:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-20 13:27:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-20 13:27:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-20 13:27:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2019-09-20 13:27:15,906 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2019-09-20 13:27:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:15,906 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2019-09-20 13:27:15,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2019-09-20 13:27:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:15,909 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:15,909 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-20 13:27:15,909 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:15,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1641385280, now seen corresponding path program 1 times [2019-09-20 13:27:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:15,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:15,978 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-20 13:27:15,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:15,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:15,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:15,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:15,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:15,982 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2019-09-20 13:27:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,014 INFO L93 Difference]: Finished difference Result 727 states and 1049 transitions. [2019-09-20 13:27:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:16,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-20 13:27:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,019 INFO L225 Difference]: With dead ends: 727 [2019-09-20 13:27:16,020 INFO L226 Difference]: Without dead ends: 727 [2019-09-20 13:27:16,021 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-20 13:27:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-20 13:27:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-20 13:27:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-20 13:27:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2019-09-20 13:27:16,036 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2019-09-20 13:27:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,037 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2019-09-20 13:27:16,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2019-09-20 13:27:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:16,040 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,040 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-20 13:27:16,040 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1283662913, now seen corresponding path program 1 times [2019-09-20 13:27:16,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,135 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-20 13:27:16,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:16,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:16,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:16,137 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2019-09-20 13:27:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,156 INFO L93 Difference]: Finished difference Result 727 states and 1048 transitions. [2019-09-20 13:27:16,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:16,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:27:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,161 INFO L225 Difference]: With dead ends: 727 [2019-09-20 13:27:16,161 INFO L226 Difference]: Without dead ends: 727 [2019-09-20 13:27:16,161 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-20 13:27:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-20 13:27:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-09-20 13:27:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-20 13:27:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1048 transitions. [2019-09-20 13:27:16,176 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1048 transitions. Word has length 104 [2019-09-20 13:27:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,177 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1048 transitions. [2019-09-20 13:27:16,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1048 transitions. [2019-09-20 13:27:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:16,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,180 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, 1, 1] [2019-09-20 13:27:16,180 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash 803234748, now seen corresponding path program 1 times [2019-09-20 13:27:16,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,268 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-20 13:27:16,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,271 INFO L87 Difference]: Start difference. First operand 727 states and 1048 transitions. Second operand 4 states. [2019-09-20 13:27:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,570 INFO L93 Difference]: Finished difference Result 984 states and 1425 transitions. [2019-09-20 13:27:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,576 INFO L225 Difference]: With dead ends: 984 [2019-09-20 13:27:16,576 INFO L226 Difference]: Without dead ends: 984 [2019-09-20 13:27:16,577 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-20 13:27:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-20 13:27:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 847. [2019-09-20 13:27:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-20 13:27:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1258 transitions. [2019-09-20 13:27:16,595 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1258 transitions. Word has length 106 [2019-09-20 13:27:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,596 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1258 transitions. [2019-09-20 13:27:16,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1258 transitions. [2019-09-20 13:27:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:27:16,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,599 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:16,599 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash -876635477, now seen corresponding path program 1 times [2019-09-20 13:27:16,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:16,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,680 INFO L87 Difference]: Start difference. First operand 847 states and 1258 transitions. Second operand 4 states. [2019-09-20 13:27:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,981 INFO L93 Difference]: Finished difference Result 979 states and 1415 transitions. [2019-09-20 13:27:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:16,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:27:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,987 INFO L225 Difference]: With dead ends: 979 [2019-09-20 13:27:16,987 INFO L226 Difference]: Without dead ends: 979 [2019-09-20 13:27:16,988 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-20 13:27:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-20 13:27:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2019-09-20 13:27:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-20 13:27:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1253 transitions. [2019-09-20 13:27:17,003 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1253 transitions. Word has length 121 [2019-09-20 13:27:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,004 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1253 transitions. [2019-09-20 13:27:17,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1253 transitions. [2019-09-20 13:27:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:27:17,007 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,007 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:17,007 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1624661431, now seen corresponding path program 1 times [2019-09-20 13:27:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:17,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,080 INFO L87 Difference]: Start difference. First operand 847 states and 1253 transitions. Second operand 4 states. [2019-09-20 13:27:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,378 INFO L93 Difference]: Finished difference Result 979 states and 1410 transitions. [2019-09-20 13:27:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:27:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,382 INFO L225 Difference]: With dead ends: 979 [2019-09-20 13:27:17,382 INFO L226 Difference]: Without dead ends: 979 [2019-09-20 13:27:17,383 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-20 13:27:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-20 13:27:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2019-09-20 13:27:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-20 13:27:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1248 transitions. [2019-09-20 13:27:17,398 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1248 transitions. Word has length 121 [2019-09-20 13:27:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,399 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1248 transitions. [2019-09-20 13:27:17,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1248 transitions. [2019-09-20 13:27:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:27:17,402 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,402 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:17,402 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1005940820, now seen corresponding path program 1 times [2019-09-20 13:27:17,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:27:17,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,477 INFO L87 Difference]: Start difference. First operand 847 states and 1248 transitions. Second operand 4 states. [2019-09-20 13:27:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,732 INFO L93 Difference]: Finished difference Result 985 states and 1451 transitions. [2019-09-20 13:27:17,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:27:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,738 INFO L225 Difference]: With dead ends: 985 [2019-09-20 13:27:17,738 INFO L226 Difference]: Without dead ends: 985 [2019-09-20 13:27:17,738 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-20 13:27:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2019-09-20 13:27:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 919. [2019-09-20 13:27:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-20 13:27:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1368 transitions. [2019-09-20 13:27:17,754 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1368 transitions. Word has length 121 [2019-09-20 13:27:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,755 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1368 transitions. [2019-09-20 13:27:17,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1368 transitions. [2019-09-20 13:27:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:27:17,758 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,758 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:17,758 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash 908942672, now seen corresponding path program 1 times [2019-09-20 13:27:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:17,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,829 INFO L87 Difference]: Start difference. First operand 919 states and 1368 transitions. Second operand 4 states. [2019-09-20 13:27:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,087 INFO L93 Difference]: Finished difference Result 1051 states and 1525 transitions. [2019-09-20 13:27:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:27:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,092 INFO L225 Difference]: With dead ends: 1051 [2019-09-20 13:27:18,093 INFO L226 Difference]: Without dead ends: 1051 [2019-09-20 13:27:18,093 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-20 13:27:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-20 13:27:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2019-09-20 13:27:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-20 13:27:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1363 transitions. [2019-09-20 13:27:18,109 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1363 transitions. Word has length 122 [2019-09-20 13:27:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,109 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1363 transitions. [2019-09-20 13:27:18,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1363 transitions. [2019-09-20 13:27:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:27:18,112 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,113 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:18,113 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,113 INFO L82 PathProgramCache]: Analyzing trace with hash -187191506, now seen corresponding path program 1 times [2019-09-20 13:27:18,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:18,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,185 INFO L87 Difference]: Start difference. First operand 919 states and 1363 transitions. Second operand 4 states. [2019-09-20 13:27:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,463 INFO L93 Difference]: Finished difference Result 1051 states and 1520 transitions. [2019-09-20 13:27:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:27:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,469 INFO L225 Difference]: With dead ends: 1051 [2019-09-20 13:27:18,469 INFO L226 Difference]: Without dead ends: 1051 [2019-09-20 13:27:18,470 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-20 13:27:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-20 13:27:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2019-09-20 13:27:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-20 13:27:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1358 transitions. [2019-09-20 13:27:18,484 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1358 transitions. Word has length 123 [2019-09-20 13:27:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,485 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1358 transitions. [2019-09-20 13:27:18,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1358 transitions. [2019-09-20 13:27:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:27:18,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,488 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:18,488 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2136062699, now seen corresponding path program 1 times [2019-09-20 13:27:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-20 13:27:18,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,563 INFO L87 Difference]: Start difference. First operand 919 states and 1358 transitions. Second operand 4 states. [2019-09-20 13:27:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,831 INFO L93 Difference]: Finished difference Result 1006 states and 1460 transitions. [2019-09-20 13:27:18,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:27:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,835 INFO L225 Difference]: With dead ends: 1006 [2019-09-20 13:27:18,836 INFO L226 Difference]: Without dead ends: 1006 [2019-09-20 13:27:18,836 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-20 13:27:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-20 13:27:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 919. [2019-09-20 13:27:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-20 13:27:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1353 transitions. [2019-09-20 13:27:18,878 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1353 transitions. Word has length 124 [2019-09-20 13:27:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,879 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1353 transitions. [2019-09-20 13:27:18,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1353 transitions. [2019-09-20 13:27:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:27:18,882 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,882 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-20 13:27:18,882 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash 195204134, now seen corresponding path program 1 times [2019-09-20 13:27:18,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-20 13:27:18,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,957 INFO L87 Difference]: Start difference. First operand 919 states and 1353 transitions. Second operand 4 states. [2019-09-20 13:27:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,250 INFO L93 Difference]: Finished difference Result 1151 states and 1695 transitions. [2019-09-20 13:27:19,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:27:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,257 INFO L225 Difference]: With dead ends: 1151 [2019-09-20 13:27:19,257 INFO L226 Difference]: Without dead ends: 1151 [2019-09-20 13:27:19,258 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-20 13:27:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-09-20 13:27:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1029. [2019-09-20 13:27:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-20 13:27:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1543 transitions. [2019-09-20 13:27:19,276 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1543 transitions. Word has length 124 [2019-09-20 13:27:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,277 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1543 transitions. [2019-09-20 13:27:19,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1543 transitions. [2019-09-20 13:27:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:27:19,280 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,281 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2019-09-20 13:27:19,281 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1476839352, now seen corresponding path program 1 times [2019-09-20 13:27:19,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-20 13:27:19,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:27:19,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:27:19,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:27:19,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:27:19,419 INFO L87 Difference]: Start difference. First operand 1029 states and 1543 transitions. Second operand 6 states. [2019-09-20 13:27:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,964 INFO L93 Difference]: Finished difference Result 1113 states and 1665 transitions. [2019-09-20 13:27:19,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:19,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-20 13:27:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,971 INFO L225 Difference]: With dead ends: 1113 [2019-09-20 13:27:19,972 INFO L226 Difference]: Without dead ends: 1113 [2019-09-20 13:27:19,972 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:27:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-20 13:27:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1037. [2019-09-20 13:27:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-09-20 13:27:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1556 transitions. [2019-09-20 13:27:19,988 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1556 transitions. Word has length 128 [2019-09-20 13:27:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,989 INFO L475 AbstractCegarLoop]: Abstraction has 1037 states and 1556 transitions. [2019-09-20 13:27:19,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:27:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1556 transitions. [2019-09-20 13:27:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:27:19,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,992 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2019-09-20 13:27:19,993 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1283532057, now seen corresponding path program 1 times [2019-09-20 13:27:19,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-20 13:27:20,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:27:20,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:27:20,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:27:20,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:27:20,124 INFO L87 Difference]: Start difference. First operand 1037 states and 1556 transitions. Second operand 6 states. [2019-09-20 13:27:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,619 INFO L93 Difference]: Finished difference Result 1110 states and 1661 transitions. [2019-09-20 13:27:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:20,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-20 13:27:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,625 INFO L225 Difference]: With dead ends: 1110 [2019-09-20 13:27:20,625 INFO L226 Difference]: Without dead ends: 1110 [2019-09-20 13:27:20,626 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:27:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-09-20 13:27:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1038. [2019-09-20 13:27:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2019-09-20 13:27:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1557 transitions. [2019-09-20 13:27:20,642 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1557 transitions. Word has length 129 [2019-09-20 13:27:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,643 INFO L475 AbstractCegarLoop]: Abstraction has 1038 states and 1557 transitions. [2019-09-20 13:27:20,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:27:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1557 transitions. [2019-09-20 13:27:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:27:20,646 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,646 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,647 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash -602359811, now seen corresponding path program 1 times [2019-09-20 13:27:20,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:27:21,437 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:27:21,509 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20487 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-20 13:27:21,511 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20485 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2019-09-20 13:27:21,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:21 BoogieIcfgContainer [2019-09-20 13:27:21,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:21,643 INFO L168 Benchmark]: Toolchain (without parser) took 19869.72 ms. Allocated memory was 140.0 MB in the beginning and 471.9 MB in the end (delta: 331.9 MB). Free memory was 85.6 MB in the beginning and 309.9 MB in the end (delta: -224.3 MB). Peak memory consumption was 107.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,644 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1026.58 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 85.4 MB in the beginning and 159.2 MB in the end (delta: -73.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,648 INFO L168 Benchmark]: Boogie Preprocessor took 139.53 ms. Allocated memory is still 201.3 MB. Free memory was 159.2 MB in the beginning and 151.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,649 INFO L168 Benchmark]: RCFGBuilder took 1315.11 ms. Allocated memory was 201.3 MB in the beginning and 226.0 MB in the end (delta: 24.6 MB). Free memory was 151.6 MB in the beginning and 176.1 MB in the end (delta: -24.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,650 INFO L168 Benchmark]: TraceAbstraction took 17383.36 ms. Allocated memory was 226.0 MB in the beginning and 471.9 MB in the end (delta: 245.9 MB). Free memory was 174.7 MB in the beginning and 309.9 MB in the end (delta: -135.2 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:21,660 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1026.58 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 85.4 MB in the beginning and 159.2 MB in the end (delta: -73.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.53 ms. Allocated memory is still 201.3 MB. Free memory was 159.2 MB in the beginning and 151.6 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1315.11 ms. Allocated memory was 201.3 MB in the beginning and 226.0 MB in the end (delta: 24.6 MB). Free memory was 151.6 MB in the beginning and 176.1 MB in the end (delta: -24.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17383.36 ms. Allocated memory was 226.0 MB in the beginning and 471.9 MB in the end (delta: 245.9 MB). Free memory was 174.7 MB in the beginning and 309.9 MB in the end (delta: -135.2 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20487 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20485 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20531, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-4:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={-1:0}, SSLv3_client_data={-4:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] *tmp___0 = 0 [L1111] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->info_callback={-4294967301:6}, skip=0, SSLv3_client_data={-4:0}, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=12292, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1250] EXPR s->version VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->version=2, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->init_buf={4:-3}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4368, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=12292, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=0, buf={20501:20505}, init=1, ret=-1, s={-1:0}, s={-1:0}, s->state=4368, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->bbio={2:1}, s->wbio={2:-1}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4384, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4368, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=1, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4384, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->hit=0, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1327] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4400, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4384, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4400, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={-4294967301:6}, ((s->s3)->tmp.new_cipher)->algorithms=20528, (s->s3)->tmp.new_cipher={20521:2}, blastFlag=2, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1340] COND FALSE !(ret <= 0) VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4416, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4400, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={-4294967301:6}, blastFlag=3, buf={20501:20505}, init=1, ret=10, s={-1:0}, s={-1:0}, s->state=4416, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4432, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4416, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=1, s={-1:0}, s={-1:0}, s->state=4432, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4448, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->s3={-1:-796}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1131] COND TRUE 1 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4432, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=7, s={-1:0}, s={-1:0}, s->state=4448, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=2, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] [L1646] __VERIFIER_error() VAL [={-4294967301:6}, blastFlag=4, buf={20501:20505}, init=1, ret=2, s={-1:0}, s={-1:0}, skip=0, SSLv3_client_data={-4:0}, state=4448, tmp=2, tmp___0={-1:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=2, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 169 locations, 1 error locations. UNSAFE Result, 17.3s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7485 SDtfs, 3047 SDslu, 9993 SDs, 0 SdLazy, 5723 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 70 SyntacticMatches, 22 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1038occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 2754 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3213 NumberOfCodeBlocks, 3213 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3035 ConstructedInterpolants, 0 QuantifiedInterpolants, 683183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 2861/2861 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...