/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 02:43:12,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 02:43:12,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 02:43:12,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 02:43:12,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 02:43:12,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 02:43:12,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 02:43:12,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 02:43:12,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 02:43:12,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 02:43:12,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 02:43:12,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 02:43:12,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 02:43:12,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 02:43:12,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 02:43:12,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 02:43:12,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 02:43:12,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 02:43:12,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 02:43:12,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 02:43:12,349 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 02:43:12,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 02:43:12,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 02:43:12,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 02:43:12,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 02:43:12,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 02:43:12,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 02:43:12,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 02:43:12,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 02:43:12,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 02:43:12,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 02:43:12,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 02:43:12,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 02:43:12,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 02:43:12,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 02:43:12,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 02:43:12,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 02:43:12,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 02:43:12,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 02:43:12,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 02:43:12,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 02:43:12,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 02:43:12,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-20 02:43:12,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 02:43:12,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 02:43:12,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-20 02:43:12,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-20 02:43:12,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 02:43:12,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 02:43:12,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 02:43:12,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 02:43:12,398 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 02:43:12,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 02:43:12,399 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 02:43:12,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 02:43:12,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 02:43:12,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 02:43:12,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 02:43:12,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 02:43:12,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 02:43:12,400 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 02:43:12,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 02:43:12,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 02:43:12,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 02:43:12,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 02:43:12,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 02:43:12,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 02:43:12,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:43:12,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 02:43:12,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 02:43:12,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 02:43:12,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 02:43:12,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 02:43:12,402 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-20 02:43:12,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-20 02:43:12,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 02:43:12,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 02:43:12,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 02:43:12,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 02:43:12,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 02:43:12,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 02:43:12,637 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 02:43:12,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-03-20 02:43:12,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17771b9b9/e64ee67d80f643d4ae15b28f42935c8e/FLAGeb99e7106 [2022-03-20 02:43:13,240 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 02:43:13,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-03-20 02:43:13,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17771b9b9/e64ee67d80f643d4ae15b28f42935c8e/FLAGeb99e7106 [2022-03-20 02:43:13,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17771b9b9/e64ee67d80f643d4ae15b28f42935c8e [2022-03-20 02:43:13,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 02:43:13,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 02:43:13,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 02:43:13,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 02:43:13,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 02:43:13,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:43:13" (1/1) ... [2022-03-20 02:43:13,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd9d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:13, skipping insertion in model container [2022-03-20 02:43:13,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:43:13" (1/1) ... [2022-03-20 02:43:13,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 02:43:13,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 02:43:14,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-03-20 02:43:14,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:43:14,094 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 02:43:14,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-03-20 02:43:14,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:43:14,257 INFO L208 MainTranslator]: Completed translation [2022-03-20 02:43:14,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14 WrapperNode [2022-03-20 02:43:14,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 02:43:14,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 02:43:14,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 02:43:14,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 02:43:14,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 02:43:14,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 02:43:14,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 02:43:14,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 02:43:14,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (1/1) ... [2022-03-20 02:43:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:43:14,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 02:43:14,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 02:43:14,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 02:43:14,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 02:43:14,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 02:43:14,457 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 02:43:14,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-03-20 02:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-03-20 02:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 02:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-03-20 02:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-03-20 02:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-20 02:43:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-03-20 02:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 02:43:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-03-20 02:43:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 02:43:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-03-20 02:43:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-03-20 02:43:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-03-20 02:43:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 02:43:14,667 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 02:43:14,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 02:43:15,715 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:43:16,066 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-03-20 02:43:16,067 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-03-20 02:43:16,088 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 02:43:16,095 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 02:43:16,095 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 02:43:16,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:43:16 BoogieIcfgContainer [2022-03-20 02:43:16,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 02:43:16,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 02:43:16,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 02:43:16,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 02:43:16,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 02:43:13" (1/3) ... [2022-03-20 02:43:16,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e68165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:43:16, skipping insertion in model container [2022-03-20 02:43:16,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:43:14" (2/3) ... [2022-03-20 02:43:16,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e68165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:43:16, skipping insertion in model container [2022-03-20 02:43:16,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:43:16" (3/3) ... [2022-03-20 02:43:16,109 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-03-20 02:43:16,114 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 02:43:16,114 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 02:43:16,152 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 02:43:16,158 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 02:43:16,158 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 02:43:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 02:43:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-20 02:43:16,179 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:16,180 INFO L499 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] [2022-03-20 02:43:16,180 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1896540148, now seen corresponding path program 1 times [2022-03-20 02:43:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:16,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704057643] [2022-03-20 02:43:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:43:16,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:16,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704057643] [2022-03-20 02:43:16,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704057643] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:16,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:16,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:16,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020217801] [2022-03-20 02:43:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:16,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:16,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:16,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:16,840 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:18,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:19,385 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-03-20 02:43:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:19,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-03-20 02:43:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:19,395 INFO L225 Difference]: With dead ends: 271 [2022-03-20 02:43:19,396 INFO L226 Difference]: Without dead ends: 124 [2022-03-20 02:43:19,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:19,401 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:19,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 558 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-20 02:43:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-20 02:43:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-03-20 02:43:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-03-20 02:43:19,449 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-03-20 02:43:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:19,449 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-03-20 02:43:19,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-03-20 02:43:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 02:43:19,453 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:19,454 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-03-20 02:43:19,454 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 02:43:19,454 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1834539841, now seen corresponding path program 1 times [2022-03-20 02:43:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:19,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513422208] [2022-03-20 02:43:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:19,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:19,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513422208] [2022-03-20 02:43:19,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513422208] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:19,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:19,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 02:43:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279830811] [2022-03-20 02:43:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:19,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 02:43:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 02:43:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:19,703 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:21,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:22,024 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-03-20 02:43:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 02:43:22,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-03-20 02:43:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:22,027 INFO L225 Difference]: With dead ends: 333 [2022-03-20 02:43:22,027 INFO L226 Difference]: Without dead ends: 226 [2022-03-20 02:43:22,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:22,029 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:22,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-03-20 02:43:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-20 02:43:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-03-20 02:43:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-03-20 02:43:22,059 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-03-20 02:43:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:22,060 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-03-20 02:43:22,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-03-20 02:43:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-20 02:43:22,062 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:22,062 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:22,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 02:43:22,063 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash 943673003, now seen corresponding path program 1 times [2022-03-20 02:43:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:22,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560026439] [2022-03-20 02:43:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:22,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560026439] [2022-03-20 02:43:22,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560026439] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:22,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:22,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232232225] [2022-03-20 02:43:22,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:22,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:22,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:22,394 INFO L87 Difference]: Start difference. First operand 226 states and 330 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:24,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:24,936 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-03-20 02:43:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-03-20 02:43:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:24,938 INFO L225 Difference]: With dead ends: 368 [2022-03-20 02:43:24,939 INFO L226 Difference]: Without dead ends: 261 [2022-03-20 02:43:24,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:24,940 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:24,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-20 02:43:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-03-20 02:43:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-03-20 02:43:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-03-20 02:43:24,958 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-03-20 02:43:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:24,958 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-03-20 02:43:24,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-03-20 02:43:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-20 02:43:24,961 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:24,961 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-20 02:43:24,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 02:43:24,961 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1523273022, now seen corresponding path program 2 times [2022-03-20 02:43:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:24,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773419336] [2022-03-20 02:43:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:25,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:25,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773419336] [2022-03-20 02:43:25,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773419336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:25,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:25,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761567769] [2022-03-20 02:43:25,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:25,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:25,237 INFO L87 Difference]: Start difference. First operand 244 states and 360 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:27,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:27,650 INFO L93 Difference]: Finished difference Result 385 states and 571 transitions. [2022-03-20 02:43:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-03-20 02:43:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:27,652 INFO L225 Difference]: With dead ends: 385 [2022-03-20 02:43:27,652 INFO L226 Difference]: Without dead ends: 260 [2022-03-20 02:43:27,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:27,654 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:27,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 490 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-03-20 02:43:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 244. [2022-03-20 02:43:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4853556485355648) internal successors, (355), 239 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 359 transitions. [2022-03-20 02:43:27,664 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 359 transitions. Word has length 75 [2022-03-20 02:43:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:27,665 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 359 transitions. [2022-03-20 02:43:27,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 359 transitions. [2022-03-20 02:43:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-20 02:43:27,667 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:27,667 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-03-20 02:43:27,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 02:43:27,668 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1541928480, now seen corresponding path program 1 times [2022-03-20 02:43:27,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:27,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267753360] [2022-03-20 02:43:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:27,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:27,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267753360] [2022-03-20 02:43:27,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267753360] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:27,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:27,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506327224] [2022-03-20 02:43:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:27,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:27,862 INFO L87 Difference]: Start difference. First operand 244 states and 359 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:29,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:30,315 INFO L93 Difference]: Finished difference Result 657 states and 976 transitions. [2022-03-20 02:43:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:30,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-03-20 02:43:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:30,319 INFO L225 Difference]: With dead ends: 657 [2022-03-20 02:43:30,319 INFO L226 Difference]: Without dead ends: 429 [2022-03-20 02:43:30,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:30,320 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:30,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-03-20 02:43:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 268. [2022-03-20 02:43:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4828897338403042) internal successors, (390), 263 states have internal predecessors, (390), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 394 transitions. [2022-03-20 02:43:30,342 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 394 transitions. Word has length 75 [2022-03-20 02:43:30,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:30,343 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 394 transitions. [2022-03-20 02:43:30,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 394 transitions. [2022-03-20 02:43:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-20 02:43:30,348 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:30,348 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-03-20 02:43:30,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 02:43:30,349 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1572013375, now seen corresponding path program 1 times [2022-03-20 02:43:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:30,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164247974] [2022-03-20 02:43:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:30,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:30,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164247974] [2022-03-20 02:43:30,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164247974] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:30,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:30,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392179827] [2022-03-20 02:43:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:30,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:30,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:30,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:30,544 INFO L87 Difference]: Start difference. First operand 268 states and 394 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:32,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:32,942 INFO L93 Difference]: Finished difference Result 421 states and 621 transitions. [2022-03-20 02:43:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:32,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-03-20 02:43:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:32,947 INFO L225 Difference]: With dead ends: 421 [2022-03-20 02:43:32,947 INFO L226 Difference]: Without dead ends: 284 [2022-03-20 02:43:32,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:32,950 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:32,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-20 02:43:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-03-20 02:43:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 393 transitions. [2022-03-20 02:43:32,959 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 393 transitions. Word has length 76 [2022-03-20 02:43:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:32,959 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 393 transitions. [2022-03-20 02:43:32,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 393 transitions. [2022-03-20 02:43:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-03-20 02:43:32,960 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:32,961 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2022-03-20 02:43:32,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 02:43:32,961 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:32,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1073962757, now seen corresponding path program 1 times [2022-03-20 02:43:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:32,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714986253] [2022-03-20 02:43:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:33,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:33,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714986253] [2022-03-20 02:43:33,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714986253] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:33,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:33,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428223214] [2022-03-20 02:43:33,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:33,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:33,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:33,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:33,164 INFO L87 Difference]: Start difference. First operand 268 states and 393 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:35,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:35,557 INFO L93 Difference]: Finished difference Result 421 states and 619 transitions. [2022-03-20 02:43:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:35,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-03-20 02:43:35,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:35,559 INFO L225 Difference]: With dead ends: 421 [2022-03-20 02:43:35,559 INFO L226 Difference]: Without dead ends: 284 [2022-03-20 02:43:35,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:35,560 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:35,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-20 02:43:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-03-20 02:43:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-03-20 02:43:35,575 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 77 [2022-03-20 02:43:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:35,575 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-03-20 02:43:35,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-03-20 02:43:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 02:43:35,576 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:35,576 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-03-20 02:43:35,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 02:43:35,577 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 273295172, now seen corresponding path program 1 times [2022-03-20 02:43:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:35,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303761374] [2022-03-20 02:43:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:35,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303761374] [2022-03-20 02:43:35,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303761374] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:35,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:35,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3013511] [2022-03-20 02:43:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:35,813 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:35,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:35,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:35,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:35,813 INFO L87 Difference]: Start difference. First operand 268 states and 392 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:37,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:38,237 INFO L93 Difference]: Finished difference Result 681 states and 1004 transitions. [2022-03-20 02:43:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-03-20 02:43:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:38,240 INFO L225 Difference]: With dead ends: 681 [2022-03-20 02:43:38,240 INFO L226 Difference]: Without dead ends: 429 [2022-03-20 02:43:38,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:38,241 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:38,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-03-20 02:43:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 274. [2022-03-20 02:43:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.4758364312267658) internal successors, (397), 269 states have internal predecessors, (397), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2022-03-20 02:43:38,251 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 78 [2022-03-20 02:43:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:38,251 INFO L478 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2022-03-20 02:43:38,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2022-03-20 02:43:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 02:43:38,252 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:38,252 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:38,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 02:43:38,253 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash 369392995, now seen corresponding path program 1 times [2022-03-20 02:43:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:38,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327289310] [2022-03-20 02:43:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-03-20 02:43:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:38,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327289310] [2022-03-20 02:43:38,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327289310] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:38,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:38,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 02:43:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880996716] [2022-03-20 02:43:38,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:38,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 02:43:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 02:43:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:38,420 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:40,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:40,903 INFO L93 Difference]: Finished difference Result 551 states and 815 transitions. [2022-03-20 02:43:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 02:43:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-03-20 02:43:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:40,906 INFO L225 Difference]: With dead ends: 551 [2022-03-20 02:43:40,906 INFO L226 Difference]: Without dead ends: 411 [2022-03-20 02:43:40,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:40,907 INFO L913 BasicCegarLoop]: 319 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:40,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-20 02:43:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-03-20 02:43:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2022-03-20 02:43:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 1.4704433497536946) internal successors, (597), 406 states have internal predecessors, (597), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 601 transitions. [2022-03-20 02:43:40,920 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 601 transitions. Word has length 78 [2022-03-20 02:43:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:40,920 INFO L478 AbstractCegarLoop]: Abstraction has 411 states and 601 transitions. [2022-03-20 02:43:40,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 601 transitions. [2022-03-20 02:43:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 02:43:40,922 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:40,922 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:40,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 02:43:40,923 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash 431432609, now seen corresponding path program 1 times [2022-03-20 02:43:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:40,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073831797] [2022-03-20 02:43:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 02:43:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073831797] [2022-03-20 02:43:41,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073831797] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:41,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:41,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 02:43:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445225181] [2022-03-20 02:43:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:41,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 02:43:41,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 02:43:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:41,098 INFO L87 Difference]: Start difference. First operand 411 states and 601 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:43,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:43,390 INFO L93 Difference]: Finished difference Result 712 states and 1043 transitions. [2022-03-20 02:43:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 02:43:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-03-20 02:43:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:43,392 INFO L225 Difference]: With dead ends: 712 [2022-03-20 02:43:43,393 INFO L226 Difference]: Without dead ends: 435 [2022-03-20 02:43:43,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:43,394 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:43,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-03-20 02:43:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-03-20 02:43:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-03-20 02:43:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 633 transitions. [2022-03-20 02:43:43,404 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 633 transitions. Word has length 78 [2022-03-20 02:43:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:43,405 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 633 transitions. [2022-03-20 02:43:43,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2022-03-20 02:43:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-20 02:43:43,406 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:43,406 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:43,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 02:43:43,406 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1609163299, now seen corresponding path program 1 times [2022-03-20 02:43:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:43,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26998456] [2022-03-20 02:43:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-03-20 02:43:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:43,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26998456] [2022-03-20 02:43:43,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26998456] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:43,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:43,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 02:43:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818603545] [2022-03-20 02:43:43,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:43,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 02:43:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:43,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 02:43:43,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:43,576 INFO L87 Difference]: Start difference. First operand 435 states and 633 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:45,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:46,023 INFO L93 Difference]: Finished difference Result 872 states and 1278 transitions. [2022-03-20 02:43:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 02:43:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-03-20 02:43:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:46,027 INFO L225 Difference]: With dead ends: 872 [2022-03-20 02:43:46,027 INFO L226 Difference]: Without dead ends: 571 [2022-03-20 02:43:46,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:46,029 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:46,029 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-03-20 02:43:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2022-03-20 02:43:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 566 states have (on average 1.4628975265017667) internal successors, (828), 566 states have internal predecessors, (828), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 832 transitions. [2022-03-20 02:43:46,044 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 832 transitions. Word has length 98 [2022-03-20 02:43:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:46,044 INFO L478 AbstractCegarLoop]: Abstraction has 571 states and 832 transitions. [2022-03-20 02:43:46,044 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 832 transitions. [2022-03-20 02:43:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-03-20 02:43:46,048 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:46,048 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:46,048 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 02:43:46,048 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:46,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash -816970310, now seen corresponding path program 1 times [2022-03-20 02:43:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:46,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448056769] [2022-03-20 02:43:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:46,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-20 02:43:46,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:46,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448056769] [2022-03-20 02:43:46,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448056769] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:46,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:46,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 02:43:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326122165] [2022-03-20 02:43:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:46,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 02:43:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 02:43:46,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:46,229 INFO L87 Difference]: Start difference. First operand 571 states and 832 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:48,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:48,666 INFO L93 Difference]: Finished difference Result 1005 states and 1467 transitions. [2022-03-20 02:43:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 02:43:48,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-03-20 02:43:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:48,670 INFO L225 Difference]: With dead ends: 1005 [2022-03-20 02:43:48,670 INFO L226 Difference]: Without dead ends: 568 [2022-03-20 02:43:48,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 02:43:48,671 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:48,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-03-20 02:43:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2022-03-20 02:43:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 822 transitions. [2022-03-20 02:43:48,686 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 822 transitions. Word has length 119 [2022-03-20 02:43:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:48,686 INFO L478 AbstractCegarLoop]: Abstraction has 568 states and 822 transitions. [2022-03-20 02:43:48,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 822 transitions. [2022-03-20 02:43:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-20 02:43:48,688 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:48,688 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:48,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 02:43:48,689 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:48,689 INFO L85 PathProgramCache]: Analyzing trace with hash 729336437, now seen corresponding path program 1 times [2022-03-20 02:43:48,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:48,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586992081] [2022-03-20 02:43:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-03-20 02:43:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586992081] [2022-03-20 02:43:48,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586992081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:48,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:48,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525529087] [2022-03-20 02:43:48,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:48,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:48,880 INFO L87 Difference]: Start difference. First operand 568 states and 822 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:50,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:51,372 INFO L93 Difference]: Finished difference Result 1490 states and 2160 transitions. [2022-03-20 02:43:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:51,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-03-20 02:43:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:51,377 INFO L225 Difference]: With dead ends: 1490 [2022-03-20 02:43:51,377 INFO L226 Difference]: Without dead ends: 938 [2022-03-20 02:43:51,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:51,379 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 110 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:51,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 282 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-03-20 02:43:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-03-20 02:43:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 652. [2022-03-20 02:43:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 647 states have (on average 1.4683153013910355) internal successors, (950), 647 states have internal predecessors, (950), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 954 transitions. [2022-03-20 02:43:51,398 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 954 transitions. Word has length 121 [2022-03-20 02:43:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:51,399 INFO L478 AbstractCegarLoop]: Abstraction has 652 states and 954 transitions. [2022-03-20 02:43:51,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 954 transitions. [2022-03-20 02:43:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-03-20 02:43:51,400 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:51,400 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:51,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 02:43:51,401 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:51,401 INFO L85 PathProgramCache]: Analyzing trace with hash -486817289, now seen corresponding path program 1 times [2022-03-20 02:43:51,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:51,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279215671] [2022-03-20 02:43:51,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-20 02:43:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279215671] [2022-03-20 02:43:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279215671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:51,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:51,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952249717] [2022-03-20 02:43:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:51,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:51,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:51,600 INFO L87 Difference]: Start difference. First operand 652 states and 954 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:53,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:54,019 INFO L93 Difference]: Finished difference Result 1674 states and 2456 transitions. [2022-03-20 02:43:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:54,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-03-20 02:43:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:54,023 INFO L225 Difference]: With dead ends: 1674 [2022-03-20 02:43:54,023 INFO L226 Difference]: Without dead ends: 1038 [2022-03-20 02:43:54,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:54,025 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:54,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-03-20 02:43:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 776. [2022-03-20 02:43:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 771 states have (on average 1.5071335927367056) internal successors, (1162), 771 states have internal predecessors, (1162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1166 transitions. [2022-03-20 02:43:54,047 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1166 transitions. Word has length 121 [2022-03-20 02:43:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:54,047 INFO L478 AbstractCegarLoop]: Abstraction has 776 states and 1166 transitions. [2022-03-20 02:43:54,048 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1166 transitions. [2022-03-20 02:43:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-03-20 02:43:54,049 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:54,049 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:54,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 02:43:54,050 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:54,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2084056150, now seen corresponding path program 1 times [2022-03-20 02:43:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:54,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231557193] [2022-03-20 02:43:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:54,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:43:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:43:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-03-20 02:43:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:43:54,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231557193] [2022-03-20 02:43:54,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231557193] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:43:54,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:43:54,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:43:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398581577] [2022-03-20 02:43:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:43:54,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:43:54,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:43:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:43:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:43:54,251 INFO L87 Difference]: Start difference. First operand 776 states and 1166 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:56,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-20 02:43:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:43:56,674 INFO L93 Difference]: Finished difference Result 1822 states and 2712 transitions. [2022-03-20 02:43:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:43:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-03-20 02:43:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:43:56,678 INFO L225 Difference]: With dead ends: 1822 [2022-03-20 02:43:56,678 INFO L226 Difference]: Without dead ends: 1062 [2022-03-20 02:43:56,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:43:56,681 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 102 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:43:56,681 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 280 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 02:43:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-03-20 02:43:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 804. [2022-03-20 02:43:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 799 states have (on average 1.5193992490613266) internal successors, (1214), 799 states have internal predecessors, (1214), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1218 transitions. [2022-03-20 02:43:56,707 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1218 transitions. Word has length 122 [2022-03-20 02:43:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:43:56,708 INFO L478 AbstractCegarLoop]: Abstraction has 804 states and 1218 transitions. [2022-03-20 02:43:56,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 02:43:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1218 transitions. [2022-03-20 02:43:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-03-20 02:43:56,710 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:43:56,710 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:56,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 02:43:56,710 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:43:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:43:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1878601165, now seen corresponding path program 1 times [2022-03-20 02:43:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:43:56,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566273117] [2022-03-20 02:43:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:43:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:43:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 02:43:58,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 02:43:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 02:43:58,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 02:43:58,826 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 02:43:58,827 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 02:43:58,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 02:43:58,831 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:43:58,837 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 02:43:58,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 02:43:58 BoogieIcfgContainer [2022-03-20 02:43:58,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 02:43:58,952 INFO L158 Benchmark]: Toolchain (without parser) took 45253.68ms. Allocated memory was 182.5MB in the beginning and 269.5MB in the end (delta: 87.0MB). Free memory was 127.6MB in the beginning and 202.7MB in the end (delta: -75.1MB). Peak memory consumption was 141.3MB. Max. memory is 8.0GB. [2022-03-20 02:43:58,953 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 147.0MB in the beginning and 146.9MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 02:43:58,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.32ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 127.4MB in the beginning and 176.1MB in the end (delta: -48.7MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-03-20 02:43:58,953 INFO L158 Benchmark]: Boogie Preprocessor took 103.99ms. Allocated memory is still 220.2MB. Free memory was 176.1MB in the beginning and 169.1MB in the end (delta: 7.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-03-20 02:43:58,953 INFO L158 Benchmark]: RCFGBuilder took 1733.90ms. Allocated memory is still 220.2MB. Free memory was 168.7MB in the beginning and 155.7MB in the end (delta: 13.0MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. [2022-03-20 02:43:58,954 INFO L158 Benchmark]: TraceAbstraction took 42853.35ms. Allocated memory was 220.2MB in the beginning and 269.5MB in the end (delta: 49.3MB). Free memory was 155.2MB in the beginning and 202.7MB in the end (delta: -47.5MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. [2022-03-20 02:43:58,955 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 147.0MB in the beginning and 146.9MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 557.32ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 127.4MB in the beginning and 176.1MB in the end (delta: -48.7MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.99ms. Allocated memory is still 220.2MB. Free memory was 176.1MB in the beginning and 169.1MB in the end (delta: 7.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1733.90ms. Allocated memory is still 220.2MB. Free memory was 168.7MB in the beginning and 155.7MB in the end (delta: 13.0MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. * TraceAbstraction took 42853.35ms. Allocated memory was 220.2MB in the beginning and 269.5MB in the end (delta: 49.3MB). Free memory was 155.2MB in the beginning and 202.7MB in the end (delta: -47.5MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1668]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1353. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967307, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) VAL [init=1, s={-10:0}, SSLv3_client_data={4:0}] [L1104] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->info_callback={0:13}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=1, tmp___2=0] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1272] EXPR s->version VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->version=6, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->init_buf={0:-1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0] [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-10:0}, s={-10:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->bbio={0:-17}, s->wbio={0:17}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=1, buf={0:18}, init=1, ret=15, s={-10:0}, s={-10:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1339] COND FALSE !(ret <= 0) [L1344] s->hit VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1349] s->init_num = 0 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:13}, ((s->s3)->tmp.new_cipher)->algorithms=4294967356, (s->s3)->tmp.new_cipher={-9:0}, blastFlag=2, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1362] COND FALSE !(ret <= 0) VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1368] s->state = 4416 [L1369] s->init_num = 0 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:13}, blastFlag=3, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-10:0}, s={-10:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967334, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->s3={-7:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1153] COND TRUE 1 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=22, s={-10:0}, s={-10:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=-19, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] [L1668] reach_error() VAL [={0:13}, blastFlag=4, buf={0:18}, init=1, ret=-19, s={-10:0}, s={-10:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=1, tmp___2=0, tmp___4=-13, tmp___5=14, tmp___6=-18] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.7s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 1214 SdHoareTripleChecker+Valid, 36.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1214 mSDsluCounter, 6047 SdHoareTripleChecker+Invalid, 34.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3226 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5089 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 2821 mSDtfsCounter, 5089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=15, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1188 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1396 NumberOfCodeBlocks, 1396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 2872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 995/995 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-20 02:43:58,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...