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.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:51,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:51,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:51,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:51,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:51,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:51,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:51,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:51,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:51,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:51,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:51,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:51,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:51,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:51,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:51,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:51,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:51,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:51,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:51,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:51,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:51,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:51,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:51,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:51,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:51,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:51,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:51,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:51,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:51,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:51,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:51,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:51,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:51,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:51,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:51,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:51,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:51,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:51,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:51,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:51,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:51,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:51,606 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:51,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:51,607 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:51,607 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:51,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:51,608 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:51,608 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:51,609 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:51,609 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:51,609 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:51,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:51,610 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:51,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:51,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:51,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:51,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:51,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:51,611 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:51,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:51,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:51,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:51,612 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:51,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:51,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:51,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:51,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:51,613 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:51,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:51,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:51,614 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:51,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:51,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:51,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:51,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:51,678 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:51,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-1.c [2019-09-16 17:04:51,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b930a84f5/9e899cf6c94044629e7ffc43210b9782/FLAG00ba4b99e [2019-09-16 17:04:52,312 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:52,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.02.i.cil-1.c [2019-09-16 17:04:52,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b930a84f5/9e899cf6c94044629e7ffc43210b9782/FLAG00ba4b99e [2019-09-16 17:04:52,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b930a84f5/9e899cf6c94044629e7ffc43210b9782 [2019-09-16 17:04:52,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:52,597 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:52,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:52,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:52,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:52,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c79f615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:52, skipping insertion in model container [2019-09-16 17:04:52,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:52" (1/1) ... [2019-09-16 17:04:52,615 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:52,685 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:53,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:53,352 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:53,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:53,613 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:53,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53 WrapperNode [2019-09-16 17:04:53,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:53,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:53,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:53,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:53,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... [2019-09-16 17:04:53,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:53,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:53,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:53,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:53,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:04:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:04:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:04:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:04:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:04:53,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:04:53,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:53,892 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:04:53,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:04:53,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:53,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:04:53,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:04:53,893 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:04:53,893 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:04:53,894 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:04:53,894 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:04:53,894 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:04:53,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:04:53,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:04:53,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:53,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:04:53,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:04:53,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:04:53,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:04:53,895 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:04:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:04:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:04:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:04:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:04:53,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:53,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:04:53,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:04:53,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:04:53,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:04:53,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:04:54,427 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:55,052 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:04:55,053 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:04:55,089 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:55,089 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:55,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:55 BoogieIcfgContainer [2019-09-16 17:04:55,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:55,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:55,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:55,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:55,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:52" (1/3) ... [2019-09-16 17:04:55,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4811bb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:55, skipping insertion in model container [2019-09-16 17:04:55,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:53" (2/3) ... [2019-09-16 17:04:55,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4811bb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:55, skipping insertion in model container [2019-09-16 17:04:55,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:55" (3/3) ... [2019-09-16 17:04:55,102 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-09-16 17:04:55,115 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:55,126 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:55,144 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:55,174 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:55,175 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:55,175 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:55,175 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:55,175 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:55,175 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:55,175 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:55,175 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-16 17:04:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:55,217 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,218 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,221 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,228 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-16 17:04:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:55,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:55,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:55,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:55,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:55,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,644 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-16 17:04:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:55,784 INFO L93 Difference]: Finished difference Result 253 states and 413 transitions. [2019-09-16 17:04:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:55,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:55,809 INFO L225 Difference]: With dead ends: 253 [2019-09-16 17:04:55,809 INFO L226 Difference]: Without dead ends: 218 [2019-09-16 17:04:55,811 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-16 17:04:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-09-16 17:04:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-16 17:04:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2019-09-16 17:04:55,879 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2019-09-16 17:04:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,880 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2019-09-16 17:04:55,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2019-09-16 17:04:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:04:55,887 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,887 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:55,887 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash -359362032, now seen corresponding path program 1 times [2019-09-16 17:04:55,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:56,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:56,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:56,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:56,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:56,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:56,049 INFO L87 Difference]: Start difference. First operand 218 states and 322 transitions. Second operand 3 states. [2019-09-16 17:04:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:56,138 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-16 17:04:56,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:56,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:04:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:56,146 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:04:56,147 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:04:56,148 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:04:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-16 17:04:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-16 17:04:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-16 17:04:56,192 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-16 17:04:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:56,193 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-16 17:04:56,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-16 17:04:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:56,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:56,200 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:56,200 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash 31651983, now seen corresponding path program 1 times [2019-09-16 17:04:56,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:56,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:56,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:56,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:56,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:56,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:56,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:56,373 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-16 17:04:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:56,912 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2019-09-16 17:04:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:56,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:56,917 INFO L225 Difference]: With dead ends: 503 [2019-09-16 17:04:56,918 INFO L226 Difference]: Without dead ends: 503 [2019-09-16 17:04:56,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-16 17:04:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-16 17:04:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 368. [2019-09-16 17:04:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-16 17:04:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-16 17:04:56,943 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-16 17:04:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:56,943 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-16 17:04:56,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-16 17:04:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:56,950 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:56,950 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:56,950 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:56,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash -102361523, now seen corresponding path program 1 times [2019-09-16 17:04:56,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:57,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:57,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:57,096 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-16 17:04:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:57,452 INFO L93 Difference]: Finished difference Result 453 states and 680 transitions. [2019-09-16 17:04:57,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:57,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:57,457 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:04:57,457 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:04:57,457 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:04:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 408. [2019-09-16 17:04:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-16 17:04:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-16 17:04:57,472 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-16 17:04:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:57,472 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-16 17:04:57,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-16 17:04:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:04:57,475 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:57,475 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:57,475 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash 976525712, now seen corresponding path program 1 times [2019-09-16 17:04:57,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:57,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:57,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:57,584 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-16 17:04:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:58,085 INFO L93 Difference]: Finished difference Result 535 states and 803 transitions. [2019-09-16 17:04:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:58,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:04:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:58,090 INFO L225 Difference]: With dead ends: 535 [2019-09-16 17:04:58,090 INFO L226 Difference]: Without dead ends: 535 [2019-09-16 17:04:58,090 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-16 17:04:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2019-09-16 17:04:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:04:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-16 17:04:58,104 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-16 17:04:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:58,105 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-16 17:04:58,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-16 17:04:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:04:58,108 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:58,108 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:58,108 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:58,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1151289447, now seen corresponding path program 1 times [2019-09-16 17:04:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:58,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,254 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-16 17:04:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:58,715 INFO L93 Difference]: Finished difference Result 533 states and 799 transitions. [2019-09-16 17:04:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:58,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:04:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:58,722 INFO L225 Difference]: With dead ends: 533 [2019-09-16 17:04:58,722 INFO L226 Difference]: Without dead ends: 533 [2019-09-16 17:04:58,723 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-16 17:04:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-16 17:04:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:04:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-16 17:04:58,738 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-16 17:04:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:58,739 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-16 17:04:58,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-16 17:04:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:04:58,741 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:58,741 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:58,741 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:58,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash 42309001, now seen corresponding path program 1 times [2019-09-16 17:04:58,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:58,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:58,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,848 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-16 17:04:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,275 INFO L93 Difference]: Finished difference Result 533 states and 797 transitions. [2019-09-16 17:04:59,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:04:59,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,281 INFO L225 Difference]: With dead ends: 533 [2019-09-16 17:04:59,281 INFO L226 Difference]: Without dead ends: 533 [2019-09-16 17:04:59,282 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-16 17:04:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-16 17:04:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:04:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-16 17:04:59,295 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-16 17:04:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,295 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-16 17:04:59,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-16 17:04:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:04:59,301 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,302 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,302 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,302 INFO L82 PathProgramCache]: Analyzing trace with hash 121930149, now seen corresponding path program 1 times [2019-09-16 17:04:59,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:59,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:59,406 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-16 17:04:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,742 INFO L93 Difference]: Finished difference Result 453 states and 674 transitions. [2019-09-16 17:04:59,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:04:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,745 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:04:59,745 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:04:59,745 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:04:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-16 17:04:59,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:04:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-16 17:04:59,753 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-16 17:04:59,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,754 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-16 17:04:59,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,754 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-16 17:04:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:04:59,755 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,755 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:59,756 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash -987050297, now seen corresponding path program 1 times [2019-09-16 17:04:59,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:59,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:59,825 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-16 17:05:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,104 INFO L93 Difference]: Finished difference Result 453 states and 672 transitions. [2019-09-16 17:05:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:00,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,112 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:05:00,112 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:05:00,112 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:05:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-16 17:05:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-16 17:05:00,122 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-16 17:05:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,122 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-16 17:05:00,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-16 17:05:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:00,124 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,124 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,125 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1365972106, now seen corresponding path program 1 times [2019-09-16 17:05:00,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:00,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:00,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,206 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-16 17:05:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,660 INFO L93 Difference]: Finished difference Result 533 states and 791 transitions. [2019-09-16 17:05:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:00,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,663 INFO L225 Difference]: With dead ends: 533 [2019-09-16 17:05:00,663 INFO L226 Difference]: Without dead ends: 533 [2019-09-16 17:05:00,664 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-16 17:05:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-16 17:05:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-16 17:05:00,674 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-16 17:05:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,675 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-16 17:05:00,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-16 17:05:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:00,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,677 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,677 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash -479395060, now seen corresponding path program 1 times [2019-09-16 17:05:00,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:00,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:00,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,753 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-16 17:05:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,061 INFO L93 Difference]: Finished difference Result 453 states and 668 transitions. [2019-09-16 17:05:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,069 INFO L225 Difference]: With dead ends: 453 [2019-09-16 17:05:01,069 INFO L226 Difference]: Without dead ends: 453 [2019-09-16 17:05:01,070 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-16 17:05:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-09-16 17:05:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-16 17:05:01,080 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-16 17:05:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,081 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-16 17:05:01,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-16 17:05:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:01,083 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,083 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,083 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash -493563964, now seen corresponding path program 1 times [2019-09-16 17:05:01,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,172 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-16 17:05:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,636 INFO L93 Difference]: Finished difference Result 533 states and 787 transitions. [2019-09-16 17:05:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,640 INFO L225 Difference]: With dead ends: 533 [2019-09-16 17:05:01,641 INFO L226 Difference]: Without dead ends: 533 [2019-09-16 17:05:01,641 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-16 17:05:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 410. [2019-09-16 17:05:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-16 17:05:01,652 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 79 [2019-09-16 17:05:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,653 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-16 17:05:01,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-16 17:05:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:01,655 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,655 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, 1] [2019-09-16 17:05:01,656 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash -565290761, now seen corresponding path program 1 times [2019-09-16 17:05:01,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:01,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:01,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:01,715 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 3 states. [2019-09-16 17:05:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,748 INFO L93 Difference]: Finished difference Result 559 states and 836 transitions. [2019-09-16 17:05:01,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:01,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-16 17:05:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,751 INFO L225 Difference]: With dead ends: 559 [2019-09-16 17:05:01,751 INFO L226 Difference]: Without dead ends: 559 [2019-09-16 17:05:01,752 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-16 17:05:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-16 17:05:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-16 17:05:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 836 transitions. [2019-09-16 17:05:01,764 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 836 transitions. Word has length 79 [2019-09-16 17:05:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,764 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 836 transitions. [2019-09-16 17:05:01,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 836 transitions. [2019-09-16 17:05:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:01,766 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,766 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,766 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2029348694, now seen corresponding path program 1 times [2019-09-16 17:05:01,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,845 INFO L87 Difference]: Start difference. First operand 559 states and 836 transitions. Second operand 4 states. [2019-09-16 17:05:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,291 INFO L93 Difference]: Finished difference Result 744 states and 1098 transitions. [2019-09-16 17:05:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-16 17:05:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,296 INFO L225 Difference]: With dead ends: 744 [2019-09-16 17:05:02,296 INFO L226 Difference]: Without dead ends: 744 [2019-09-16 17:05:02,296 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-16 17:05:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 559. [2019-09-16 17:05:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-16 17:05:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 833 transitions. [2019-09-16 17:05:02,311 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 833 transitions. Word has length 83 [2019-09-16 17:05:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,311 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 833 transitions. [2019-09-16 17:05:02,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 833 transitions. [2019-09-16 17:05:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:02,313 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,313 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:02,313 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash -20039148, now seen corresponding path program 1 times [2019-09-16 17:05:02,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-16 17:05:02,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:02,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:02,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:02,383 INFO L87 Difference]: Start difference. First operand 559 states and 833 transitions. Second operand 3 states. [2019-09-16 17:05:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,413 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2019-09-16 17:05:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:02,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:05:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,417 INFO L225 Difference]: With dead ends: 708 [2019-09-16 17:05:02,417 INFO L226 Difference]: Without dead ends: 708 [2019-09-16 17:05:02,418 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-16 17:05:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-16 17:05:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-16 17:05:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1058 transitions. [2019-09-16 17:05:02,432 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1058 transitions. Word has length 83 [2019-09-16 17:05:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,433 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1058 transitions. [2019-09-16 17:05:02,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1058 transitions. [2019-09-16 17:05:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:02,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,435 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:02,436 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1988056367, now seen corresponding path program 1 times [2019-09-16 17:05:02,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:02,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:02,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:02,557 INFO L87 Difference]: Start difference. First operand 708 states and 1058 transitions. Second operand 6 states. [2019-09-16 17:05:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,116 INFO L93 Difference]: Finished difference Result 790 states and 1178 transitions. [2019-09-16 17:05:03,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:03,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-09-16 17:05:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,125 INFO L225 Difference]: With dead ends: 790 [2019-09-16 17:05:03,125 INFO L226 Difference]: Without dead ends: 790 [2019-09-16 17:05:03,126 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-16 17:05:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-16 17:05:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 716. [2019-09-16 17:05:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-16 17:05:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1071 transitions. [2019-09-16 17:05:03,147 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1071 transitions. Word has length 104 [2019-09-16 17:05:03,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,147 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 1071 transitions. [2019-09-16 17:05:03,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1071 transitions. [2019-09-16 17:05:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:03,149 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,149 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:03,150 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 853686630, now seen corresponding path program 1 times [2019-09-16 17:05:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:05:03,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:03,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:03,300 INFO L87 Difference]: Start difference. First operand 716 states and 1071 transitions. Second operand 6 states. [2019-09-16 17:05:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,779 INFO L93 Difference]: Finished difference Result 787 states and 1174 transitions. [2019-09-16 17:05:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:03,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-16 17:05:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,785 INFO L225 Difference]: With dead ends: 787 [2019-09-16 17:05:03,785 INFO L226 Difference]: Without dead ends: 787 [2019-09-16 17:05:03,786 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-16 17:05:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-16 17:05:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 717. [2019-09-16 17:05:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-16 17:05:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1072 transitions. [2019-09-16 17:05:03,801 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1072 transitions. Word has length 105 [2019-09-16 17:05:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,801 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1072 transitions. [2019-09-16 17:05:03,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1072 transitions. [2019-09-16 17:05:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-16 17:05:03,803 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,804 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] [2019-09-16 17:05:03,804 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash 748535367, now seen corresponding path program 1 times [2019-09-16 17:05:03,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:04,418 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 17:05:04,473 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967301 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-16 17:05:04,480 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967303 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-16 17:05:04,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:04 BoogieIcfgContainer [2019-09-16 17:05:04,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:04,590 INFO L168 Benchmark]: Toolchain (without parser) took 11992.21 ms. Allocated memory was 138.4 MB in the beginning and 384.3 MB in the end (delta: 245.9 MB). Free memory was 83.5 MB in the beginning and 65.9 MB in the end (delta: 17.7 MB). Peak memory consumption was 263.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:04,591 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:04,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1017.40 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 83.3 MB in the beginning and 156.3 MB in the end (delta: -73.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:04,593 INFO L168 Benchmark]: Boogie Preprocessor took 184.96 ms. Allocated memory is still 199.2 MB. Free memory was 156.3 MB in the beginning and 148.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:04,594 INFO L168 Benchmark]: RCFGBuilder took 1286.37 ms. Allocated memory was 199.2 MB in the beginning and 220.7 MB in the end (delta: 21.5 MB). Free memory was 148.5 MB in the beginning and 170.5 MB in the end (delta: -22.0 MB). Peak memory consumption was 85.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:04,595 INFO L168 Benchmark]: TraceAbstraction took 9494.41 ms. Allocated memory was 220.7 MB in the beginning and 384.3 MB in the end (delta: 163.6 MB). Free memory was 170.5 MB in the beginning and 65.9 MB in the end (delta: 104.7 MB). Peak memory consumption was 268.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:04,628 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1017.40 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 83.3 MB in the beginning and 156.3 MB in the end (delta: -73.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 184.96 ms. Allocated memory is still 199.2 MB. Free memory was 156.3 MB in the beginning and 148.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1286.37 ms. Allocated memory was 199.2 MB in the beginning and 220.7 MB in the end (delta: 21.5 MB). Free memory was 148.5 MB in the beginning and 170.5 MB in the end (delta: -22.0 MB). Peak memory consumption was 85.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9494.41 ms. Allocated memory was 220.7 MB in the beginning and 384.3 MB in the end (delta: 163.6 MB). Free memory was 170.5 MB in the beginning and 65.9 MB in the end (delta: 104.7 MB). Peak memory consumption was 268.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967301 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 4294967303 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: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1338. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967344, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-3: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={2:0}, SSLv3_client_data={-3:0}] [L1080] BUF_MEM *buf ; [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 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->info_callback={-4294967300:5}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=12292, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->version=1, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->init_buf={4294967297:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967300:5}, (s->s3)->tmp.reuse_message=4294967341, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->s3={2:139}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=12292, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967300:5}, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->state=4368, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] EXPR s->wbio VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->bbio={2:2}, s->wbio={2:2}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1310] COND FALSE !((unsigned long )s->bbio != (unsigned long )s->wbio) [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967300:5}, (s->s3)->tmp.reuse_message=4294967341, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->s3={2:139}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4368, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967300:5}, blastFlag=1, init=1, ret=10, s={2:0}, s={2:0}, s->state=4384, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] blastFlag = 2 VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->hit=0, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1334] s->init_num = 0 VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967300:5}, (s->s3)->tmp.reuse_message=4294967341, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:139}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4384, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967300:5}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->state=4400, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={-4294967300:5}, ((s->s3)->tmp.new_cipher)->algorithms=4294967340, (s->s3)->tmp.new_cipher={4294967320:2}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:139}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967300:5}, (s->s3)->tmp.reuse_message=4294967341, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->s3={2:139}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4400, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={-4294967300:5}, blastFlag=3, init=1, ret=6, s={2:0}, s={2:0}, s->state=4416, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967300:5}, (s->s3)->tmp.reuse_message=4294967341, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:139}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4416, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={-4294967300:5}, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->state=4432, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [={-4294967300:5}, blastFlag=4, init=1, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={-4294967300:5}, blastFlag=4, init=1, ret=2, s={2:0}, s={2:0}, skip=0, SSLv3_client_data={-3:0}, state=4432, tmp=0, tmp___0={2:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=2, tmp___5=1, tmp___6=2, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. UNSAFE Result, 9.4s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3615 SDtfs, 1985 SDslu, 4743 SDs, 0 SdLazy, 2894 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=17, 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 1255 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1380 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1245 ConstructedInterpolants, 0 QuantifiedInterpolants, 274211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 863/863 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...