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.03.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:53,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:53,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:53,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:53,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:53,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:53,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:53,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:53,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:53,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:53,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:53,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:53,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:53,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:53,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:53,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:53,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:53,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:53,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:53,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:53,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:53,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:53,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:53,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:53,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:53,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:53,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:53,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:53,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:53,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:53,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:53,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:53,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:53,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:53,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:53,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:53,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:53,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:53,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:53,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:53,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:53,092 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:53,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:53,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:53,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:53,108 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:53,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:53,109 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:53,110 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:53,110 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:53,110 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:53,110 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:53,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:53,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:53,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:53,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:53,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:53,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:53,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:53,113 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:53,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:53,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:53,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:53,114 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:53,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:53,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:53,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:53,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:53,115 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:53,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:53,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:53,116 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:53,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:53,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:53,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:53,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:53,180 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:53,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-1.c [2019-09-16 17:04:53,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff684f6c/ec2f75132a9c4d2c9443c3cf9bd0485f/FLAG2edd2e89a [2019-09-16 17:04:53,820 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:53,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-1.c [2019-09-16 17:04:53,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff684f6c/ec2f75132a9c4d2c9443c3cf9bd0485f/FLAG2edd2e89a [2019-09-16 17:04:54,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff684f6c/ec2f75132a9c4d2c9443c3cf9bd0485f [2019-09-16 17:04:54,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:54,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:54,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:54,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:54,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:54,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:54" (1/1) ... [2019-09-16 17:04:54,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d061354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:54, skipping insertion in model container [2019-09-16 17:04:54,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:54" (1/1) ... [2019-09-16 17:04:54,094 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:54,180 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:54,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:54,844 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:55,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:55,092 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:55,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:55 WrapperNode [2019-09-16 17:04:55,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:55,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:55,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:55,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:55,111 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:55" (1/1) ... [2019-09-16 17:04:55,113 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:55" (1/1) ... [2019-09-16 17:04:55,158 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:55" (1/1) ... [2019-09-16 17:04:55,159 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:55" (1/1) ... [2019-09-16 17:04:55,261 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:55" (1/1) ... [2019-09-16 17:04:55,287 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:55" (1/1) ... [2019-09-16 17:04:55,299 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:55" (1/1) ... [2019-09-16 17:04:55,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:55,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:55,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:55,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:55,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:55" (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:55,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:04:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:04:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:04:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:04:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:04:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:04:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:04:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:04:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:04:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:04:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:04:55,380 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:04:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:04:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:04:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:04:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:04:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:04:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:04:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:04:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:04:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:04:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:04:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:04:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:04:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:04:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:04:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:04:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:04:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:04:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:04:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:04:55,885 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:56,512 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:04:56,513 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:04:56,535 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:56,535 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:56,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:56 BoogieIcfgContainer [2019-09-16 17:04:56,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:56,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:56,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:56,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:56,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:54" (1/3) ... [2019-09-16 17:04:56,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6d2877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:56, skipping insertion in model container [2019-09-16 17:04:56,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:55" (2/3) ... [2019-09-16 17:04:56,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6d2877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:56, skipping insertion in model container [2019-09-16 17:04:56,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:56" (3/3) ... [2019-09-16 17:04:56,546 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-09-16 17:04:56,559 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:56,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:56,590 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:56,624 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:56,624 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:56,625 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:56,625 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:56,625 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:56,625 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:56,626 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:56,626 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-16 17:04:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:56,663 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:56,664 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:56,667 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-16 17:04:56,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:56,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:56,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,016 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:57,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:57,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:57,043 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-16 17:04:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:57,149 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-16 17:04:57,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:57,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:57,166 INFO L225 Difference]: With dead ends: 254 [2019-09-16 17:04:57,166 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:04:57,168 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:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:04:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-16 17:04:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-16 17:04:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-16 17:04:57,238 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-16 17:04:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:57,239 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-16 17:04:57,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-16 17:04:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:04:57,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:57,243 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:57,243 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-16 17:04:57,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:57,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:57,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,414 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:57,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:57,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:57,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:57,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:57,419 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-16 17:04:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:57,484 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-16 17:04:57,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:57,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:04:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:57,489 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:04:57,489 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:04:57,490 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:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:04:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-16 17:04:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-16 17:04:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-16 17:04:57,514 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-16 17:04:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:57,515 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-16 17:04:57,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-16 17:04:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:57,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:57,521 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:57,521 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:57,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -592195955, now seen corresponding path program 1 times [2019-09-16 17:04:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:57,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:57,727 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,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:57,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:57,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:57,731 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-16 17:04:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:58,295 INFO L93 Difference]: Finished difference Result 504 states and 746 transitions. [2019-09-16 17:04:58,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:58,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:58,300 INFO L225 Difference]: With dead ends: 504 [2019-09-16 17:04:58,301 INFO L226 Difference]: Without dead ends: 504 [2019-09-16 17:04:58,301 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,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-16 17:04:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 368. [2019-09-16 17:04:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-16 17:04:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-16 17:04:58,321 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-16 17:04:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:58,322 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-16 17:04:58,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-16 17:04:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:58,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:58,327 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:58,327 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:58,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash -726209461, now seen corresponding path program 1 times [2019-09-16 17:04:58,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:58,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:58,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,418 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:58,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,421 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-16 17:04:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:58,769 INFO L93 Difference]: Finished difference Result 454 states and 681 transitions. [2019-09-16 17:04:58,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:58,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:04:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:58,773 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:04:58,774 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:04:58,774 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,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:04:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 408. [2019-09-16 17:04:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-16 17:04:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-16 17:04:58,787 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-16 17:04:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:58,788 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-16 17:04:58,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-16 17:04:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:04:58,791 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:58,791 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:58,791 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1182891182, now seen corresponding path program 1 times [2019-09-16 17:04:58,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:58,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:58,893 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:58,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:58,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:58,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:58,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:58,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:58,896 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-16 17:04:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:59,440 INFO L93 Difference]: Finished difference Result 536 states and 804 transitions. [2019-09-16 17:04:59,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:59,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:04:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:59,449 INFO L225 Difference]: With dead ends: 536 [2019-09-16 17:04:59,449 INFO L226 Difference]: Without dead ends: 536 [2019-09-16 17:04:59,449 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,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-16 17:04:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 410. [2019-09-16 17:04:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:04:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-16 17:04:59,459 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-16 17:04:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:59,460 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-16 17:04:59,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-16 17:04:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:04:59,462 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,463 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,463 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1433744923, now seen corresponding path program 1 times [2019-09-16 17:04:59,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,558 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,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:59,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:59,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:59,561 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-16 17:05:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,039 INFO L93 Difference]: Finished difference Result 534 states and 800 transitions. [2019-09-16 17:05:00,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:00,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,044 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:00,044 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:00,044 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,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-16 17:05:00,056 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-16 17:05:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,056 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-16 17:05:00,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-16 17:05:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:00,058 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,058 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,059 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1752241927, now seen corresponding path program 1 times [2019-09-16 17:05:00,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:00,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:00,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:00,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,160 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-16 17:05:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,619 INFO L93 Difference]: Finished difference Result 534 states and 798 transitions. [2019-09-16 17:05:00,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:00,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,623 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:00,624 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:00,624 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,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-16 17:05:00,635 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-16 17:05:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,635 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-16 17:05:00,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-16 17:05:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:00,637 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,637 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:00,638 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1831863075, now seen corresponding path program 1 times [2019-09-16 17:05:00,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:00,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:00,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,731 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-16 17:05:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,031 INFO L93 Difference]: Finished difference Result 454 states and 675 transitions. [2019-09-16 17:05:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,035 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:01,035 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:01,035 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,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-16 17:05:01,045 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-16 17:05:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,045 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-16 17:05:01,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-16 17:05:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:01,047 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,047 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,047 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 722882629, now seen corresponding path program 1 times [2019-09-16 17:05:01,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,120 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-16 17:05:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,419 INFO L93 Difference]: Finished difference Result 454 states and 673 transitions. [2019-09-16 17:05:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,424 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:01,424 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:01,425 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,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-16 17:05:01,435 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-16 17:05:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,435 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-16 17:05:01,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-16 17:05:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:01,437 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,437 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:01,438 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1460682036, now seen corresponding path program 1 times [2019-09-16 17:05:01,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,508 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:01,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,510 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-16 17:05:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,945 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2019-09-16 17:05:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,954 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:01,954 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:01,954 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,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-16 17:05:01,969 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-16 17:05:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,970 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-16 17:05:01,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-16 17:05:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:01,972 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,972 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:01,972 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1160620953, now seen corresponding path program 1 times [2019-09-16 17:05:01,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,058 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:02,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,060 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-16 17:05:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,493 INFO L93 Difference]: Finished difference Result 534 states and 790 transitions. [2019-09-16 17:05:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,497 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:02,497 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:02,497 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,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-16 17:05:02,507 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-16 17:05:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,508 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-16 17:05:02,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-16 17:05:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:02,510 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,510 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:02,510 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,511 INFO L82 PathProgramCache]: Analyzing trace with hash 988918094, now seen corresponding path program 1 times [2019-09-16 17:05:02,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,602 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:02,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,604 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-16 17:05:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,010 INFO L93 Difference]: Finished difference Result 454 states and 667 transitions. [2019-09-16 17:05:03,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,014 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:03,015 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:03,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-16 17:05:03,031 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 78 [2019-09-16 17:05:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,031 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-16 17:05:03,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-16 17:05:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:03,034 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,035 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:03,035 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1288979177, now seen corresponding path program 1 times [2019-09-16 17:05:03,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,142 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:03,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,150 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2019-09-16 17:05:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,492 INFO L93 Difference]: Finished difference Result 454 states and 665 transitions. [2019-09-16 17:05:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,496 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:03,496 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:03,496 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2019-09-16 17:05:03,505 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 78 [2019-09-16 17:05:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,506 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2019-09-16 17:05:03,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2019-09-16 17:05:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:03,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,508 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:03,508 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2074470850, now seen corresponding path program 1 times [2019-09-16 17:05:03,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,573 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:03,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,575 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2019-09-16 17:05:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,005 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2019-09-16 17:05:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,011 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:04,011 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:04,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2019-09-16 17:05:04,031 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2019-09-16 17:05:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,032 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2019-09-16 17:05:04,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2019-09-16 17:05:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:04,034 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,035 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,035 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash 784493186, now seen corresponding path program 1 times [2019-09-16 17:05:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,153 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:04,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,155 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2019-09-16 17:05:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,588 INFO L93 Difference]: Finished difference Result 528 states and 775 transitions. [2019-09-16 17:05:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,591 INFO L225 Difference]: With dead ends: 528 [2019-09-16 17:05:04,592 INFO L226 Difference]: Without dead ends: 528 [2019-09-16 17:05:04,592 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-16 17:05:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 410. [2019-09-16 17:05:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2019-09-16 17:05:04,602 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2019-09-16 17:05:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,602 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2019-09-16 17:05:04,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2019-09-16 17:05:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:04,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,604 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:04,605 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash 702663552, now seen corresponding path program 1 times [2019-09-16 17:05:04,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,666 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:04,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,668 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2019-09-16 17:05:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,958 INFO L93 Difference]: Finished difference Result 454 states and 659 transitions. [2019-09-16 17:05:04,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,962 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:04,962 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:04,963 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2019-09-16 17:05:04,979 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 79 [2019-09-16 17:05:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,980 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2019-09-16 17:05:04,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2019-09-16 17:05:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:04,982 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,983 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:04,983 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash -587314112, now seen corresponding path program 1 times [2019-09-16 17:05:04,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,090 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:05,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,092 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2019-09-16 17:05:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,453 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2019-09-16 17:05:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,456 INFO L225 Difference]: With dead ends: 448 [2019-09-16 17:05:05,457 INFO L226 Difference]: Without dead ends: 448 [2019-09-16 17:05:05,458 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-16 17:05:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2019-09-16 17:05:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2019-09-16 17:05:05,467 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 79 [2019-09-16 17:05:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,467 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2019-09-16 17:05:05,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2019-09-16 17:05:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:05,469 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,469 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:05,470 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash 51641255, now seen corresponding path program 1 times [2019-09-16 17:05:05,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:05,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,542 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2019-09-16 17:05:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,033 INFO L93 Difference]: Finished difference Result 510 states and 747 transitions. [2019-09-16 17:05:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,037 INFO L225 Difference]: With dead ends: 510 [2019-09-16 17:05:06,037 INFO L226 Difference]: Without dead ends: 510 [2019-09-16 17:05:06,038 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-16 17:05:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-16 17:05:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2019-09-16 17:05:06,060 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2019-09-16 17:05:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,061 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2019-09-16 17:05:06,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2019-09-16 17:05:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:06,063 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,064 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,064 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 475287977, now seen corresponding path program 1 times [2019-09-16 17:05:06,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,178 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2019-09-16 17:05:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,428 INFO L93 Difference]: Finished difference Result 430 states and 624 transitions. [2019-09-16 17:05:06,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,431 INFO L225 Difference]: With dead ends: 430 [2019-09-16 17:05:06,431 INFO L226 Difference]: Without dead ends: 430 [2019-09-16 17:05:06,432 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-16 17:05:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2019-09-16 17:05:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2019-09-16 17:05:06,441 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2019-09-16 17:05:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,442 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2019-09-16 17:05:06,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2019-09-16 17:05:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:06,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,446 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,446 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 643036702, now seen corresponding path program 1 times [2019-09-16 17:05:06,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,522 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:06,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,524 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2019-09-16 17:05:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,953 INFO L93 Difference]: Finished difference Result 510 states and 743 transitions. [2019-09-16 17:05:06,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,957 INFO L225 Difference]: With dead ends: 510 [2019-09-16 17:05:06,957 INFO L226 Difference]: Without dead ends: 510 [2019-09-16 17:05:06,958 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-16 17:05:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-16 17:05:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2019-09-16 17:05:06,970 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2019-09-16 17:05:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,970 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2019-09-16 17:05:06,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2019-09-16 17:05:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:06,972 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,973 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:06,973 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash 891183196, now seen corresponding path program 1 times [2019-09-16 17:05:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 17:05:07,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:07,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:07,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,058 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2019-09-16 17:05:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,096 INFO L93 Difference]: Finished difference Result 559 states and 812 transitions. [2019-09-16 17:05:07,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:07,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 17:05:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,100 INFO L225 Difference]: With dead ends: 559 [2019-09-16 17:05:07,101 INFO L226 Difference]: Without dead ends: 559 [2019-09-16 17:05:07,101 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:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-16 17:05:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-16 17:05:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-16 17:05:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2019-09-16 17:05:07,121 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2019-09-16 17:05:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,121 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2019-09-16 17:05:07,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2019-09-16 17:05:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:07,124 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,124 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:07,125 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 363210002, now seen corresponding path program 1 times [2019-09-16 17:05:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,223 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:07,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:07,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:07,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:07,225 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2019-09-16 17:05:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,255 INFO L93 Difference]: Finished difference Result 708 states and 1030 transitions. [2019-09-16 17:05:07,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:07,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:05:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,261 INFO L225 Difference]: With dead ends: 708 [2019-09-16 17:05:07,262 INFO L226 Difference]: Without dead ends: 708 [2019-09-16 17:05:07,262 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:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-16 17:05:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-16 17:05:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-16 17:05:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2019-09-16 17:05:07,277 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2019-09-16 17:05:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,278 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2019-09-16 17:05:07,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2019-09-16 17:05:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:07,281 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,281 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:07,281 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1857235727, now seen corresponding path program 1 times [2019-09-16 17:05:07,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,464 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:07,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:07,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:07,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:07,466 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 6 states. [2019-09-16 17:05:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,013 INFO L93 Difference]: Finished difference Result 791 states and 1151 transitions. [2019-09-16 17:05:08,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:08,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-09-16 17:05:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,019 INFO L225 Difference]: With dead ends: 791 [2019-09-16 17:05:08,019 INFO L226 Difference]: Without dead ends: 791 [2019-09-16 17:05:08,020 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:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-09-16 17:05:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 716. [2019-09-16 17:05:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-16 17:05:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1043 transitions. [2019-09-16 17:05:08,036 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1043 transitions. Word has length 104 [2019-09-16 17:05:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,036 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 1043 transitions. [2019-09-16 17:05:08,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1043 transitions. [2019-09-16 17:05:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:05:08,039 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,039 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:08,039 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1303361832, now seen corresponding path program 1 times [2019-09-16 17:05:08,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,146 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:08,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:08,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:08,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:08,148 INFO L87 Difference]: Start difference. First operand 716 states and 1043 transitions. Second operand 6 states. [2019-09-16 17:05:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,667 INFO L93 Difference]: Finished difference Result 788 states and 1147 transitions. [2019-09-16 17:05:08,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:08,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-16 17:05:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,671 INFO L225 Difference]: With dead ends: 788 [2019-09-16 17:05:08,672 INFO L226 Difference]: Without dead ends: 788 [2019-09-16 17:05:08,672 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:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-16 17:05:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 717. [2019-09-16 17:05:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-16 17:05:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2019-09-16 17:05:08,688 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 105 [2019-09-16 17:05:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,688 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2019-09-16 17:05:08,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2019-09-16 17:05:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-16 17:05:08,690 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,691 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:08,691 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1198210569, now seen corresponding path program 1 times [2019-09-16 17:05:08,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:05:09,227 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 17:05:09,271 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967306 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:09,272 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967310 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:09,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:09 BoogieIcfgContainer [2019-09-16 17:05:09,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:09,414 INFO L168 Benchmark]: Toolchain (without parser) took 15335.18 ms. Allocated memory was 136.3 MB in the beginning and 428.9 MB in the end (delta: 292.6 MB). Free memory was 82.3 MB in the beginning and 135.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 239.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:09,415 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 136.3 MB. Free memory was 102.3 MB in the beginning and 102.1 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:09,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1016.18 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 82.1 MB in the beginning and 160.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:09,418 INFO L168 Benchmark]: Boogie Preprocessor took 220.31 ms. Allocated memory is still 200.8 MB. Free memory was 160.5 MB in the beginning and 152.7 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:09,426 INFO L168 Benchmark]: RCFGBuilder took 1221.69 ms. Allocated memory was 200.8 MB in the beginning and 217.1 MB in the end (delta: 16.3 MB). Free memory was 152.7 MB in the beginning and 176.5 MB in the end (delta: -23.7 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:09,428 INFO L168 Benchmark]: TraceAbstraction took 12872.00 ms. Allocated memory was 217.1 MB in the beginning and 428.9 MB in the end (delta: 211.8 MB). Free memory was 176.5 MB in the beginning and 135.8 MB in the end (delta: 40.7 MB). Peak memory consumption was 252.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:09,439 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.27 ms. Allocated memory is still 136.3 MB. Free memory was 102.3 MB in the beginning and 102.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1016.18 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 82.1 MB in the beginning and 160.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 220.31 ms. Allocated memory is still 200.8 MB. Free memory was 160.5 MB in the beginning and 152.7 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1221.69 ms. Allocated memory was 200.8 MB in the beginning and 217.1 MB in the end (delta: 16.3 MB). Free memory was 152.7 MB in the beginning and 176.5 MB in the end (delta: -23.7 MB). Peak memory consumption was 93.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12872.00 ms. Allocated memory was 217.1 MB in the beginning and 428.9 MB in the end (delta: 211.8 MB). Free memory was 176.5 MB in the beginning and 135.8 MB in the end (delta: 40.7 MB). Peak memory consumption was 252.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967306 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 4294967310 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)=4294967334, \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={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, (s->s3)->tmp.reuse_message=4368, blastFlag=0, init=1, ret=-1, s={2:0}, s={2:0}, s->s3={2:-796}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [={-4294967301:6}, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->bbio={2:1}, s->wbio={-1: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] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={-4294967301:6}, (s->s3)->tmp.reuse_message=4384, blastFlag=1, init=1, ret=11, s={2:0}, s={2:0}, s->s3={2:-796}, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [={-4294967301:6}, blastFlag=1, init=1, ret=11, 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 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, (s->s3)->tmp.reuse_message=4400, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, ((s->s3)->tmp.new_cipher)->algorithms=4294967330, (s->s3)->tmp.new_cipher={4294967317:2}, blastFlag=2, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, (s->s3)->tmp.reuse_message=4416, blastFlag=3, init=1, ret=7, s={2:0}, s={2:0}, s->s3={2:-796}, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, blastFlag=3, init=1, ret=7, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, (s->s3)->tmp.reuse_message=4432, blastFlag=4, init=1, ret=1, s={2:0}, s={2:0}, s->s3={2:-796}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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 [={-4294967301:6}, 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, 12.7s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5114 SDtfs, 2384 SDslu, 6858 SDs, 0 SdLazy, 4107 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=24, 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.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 397585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 1286/1286 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...