/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:41:00,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:41:00,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:41:00,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:41:00,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:41:00,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:41:00,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:41:00,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:41:00,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:41:00,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:41:00,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:41:00,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:41:00,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:41:00,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:41:00,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:41:00,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:41:00,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:41:00,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:41:00,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:41:00,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:41:00,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:41:00,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:41:00,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:41:00,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:41:00,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:41:00,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:41:00,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:41:00,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:41:00,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:41:00,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:41:00,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:41:00,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:41:00,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:41:00,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:41:00,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:41:00,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:41:00,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:41:00,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:41:00,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:41:00,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:41:00,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:41:00,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:41:00,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:41:00,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:41:00,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:41:00,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:41:00,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:41:00,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:41:00,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:41:00,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:41:00,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:41:00,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:41:00,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:41:00,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:41:00,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:41:00,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:41:00,290 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:41:00,290 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-02-15 00:41:00,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:41:00,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:41:00,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:41:00,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:41:00,536 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:41:00,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c [2022-02-15 00:41:00,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f31cb6e0/93fda701713d4cfebc26ec1d2f58da50/FLAGbd655b4f7 [2022-02-15 00:41:01,028 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:41:01,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c [2022-02-15 00:41:01,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f31cb6e0/93fda701713d4cfebc26ec1d2f58da50/FLAGbd655b4f7 [2022-02-15 00:41:01,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f31cb6e0/93fda701713d4cfebc26ec1d2f58da50 [2022-02-15 00:41:01,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:41:01,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:41:01,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:41:01,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:41:01,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:41:01,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e23a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01, skipping insertion in model container [2022-02-15 00:41:01,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:41:01,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:41:01,362 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.03.i.cil-1.c[65397,65410] [2022-02-15 00:41:01,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:41:01,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:41:01,451 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.03.i.cil-1.c[65397,65410] [2022-02-15 00:41:01,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:41:01,464 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:41:01,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01 WrapperNode [2022-02-15 00:41:01,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:41:01,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:41:01,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:41:01,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:41:01,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:41:01,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:41:01,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:41:01,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:41:01,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (1/1) ... [2022-02-15 00:41:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:41:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:41:01,615 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-02-15 00:41:01,648 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-02-15 00:41:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:41:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:41:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:41:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-02-15 00:41:01,670 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-02-15 00:41:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:41:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-02-15 00:41:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-02-15 00:41:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-15 00:41:01,671 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-15 00:41:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:41:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:41:01,671 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:41:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:41:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-02-15 00:41:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:41:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-15 00:41:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:41:01,816 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:41:01,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:41:03,135 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:41:03,377 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-02-15 00:41:03,378 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-02-15 00:41:03,386 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:41:03,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:41:03,391 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:41:03,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:41:03 BoogieIcfgContainer [2022-02-15 00:41:03,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:41:03,393 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:41:03,393 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:41:03,394 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:41:03,396 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:41:03" (1/1) ... [2022-02-15 00:41:03,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:41:03 BasicIcfg [2022-02-15 00:41:03,425 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:41:03,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:41:03,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:41:03,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:41:03,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:41:01" (1/4) ... [2022-02-15 00:41:03,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1a433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:41:03, skipping insertion in model container [2022-02-15 00:41:03,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:41:01" (2/4) ... [2022-02-15 00:41:03,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1a433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:41:03, skipping insertion in model container [2022-02-15 00:41:03,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:41:03" (3/4) ... [2022-02-15 00:41:03,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1a433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:41:03, skipping insertion in model container [2022-02-15 00:41:03,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:41:03" (4/4) ... [2022-02-15 00:41:03,430 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.cJordan [2022-02-15 00:41:03,433 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:41:03,433 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:41:03,459 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:41:03,463 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 00:41:03,464 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:41:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 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-02-15 00:41:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 00:41:03,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:03,481 INFO L514 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-02-15 00:41:03,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1582464962, now seen corresponding path program 1 times [2022-02-15 00:41:03,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:03,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941327884] [2022-02-15 00:41:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:41:03,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:03,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941327884] [2022-02-15 00:41:03,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941327884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:03,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:03,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:03,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621800049] [2022-02-15 00:41:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:03,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:03,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:03,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:03,969 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 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-02-15 00:41:05,997 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-02-15 00:41:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:06,585 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2022-02-15 00:41:06,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:06,588 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-02-15 00:41:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:06,601 INFO L225 Difference]: With dead ends: 142 [2022-02-15 00:41:06,601 INFO L226 Difference]: Without dead ends: 122 [2022-02-15 00:41:06,602 INFO L932 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-02-15 00:41:06,609 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:06,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-02-15 00:41:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-02-15 00:41:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-02-15 00:41:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 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-02-15 00:41:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-02-15 00:41:06,671 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-02-15 00:41:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:06,671 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-02-15 00:41:06,671 INFO L471 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-02-15 00:41:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-02-15 00:41:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-15 00:41:06,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:06,673 INFO L514 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] [2022-02-15 00:41:06,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:41:06,673 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 826783867, now seen corresponding path program 1 times [2022-02-15 00:41:06,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:06,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410892929] [2022-02-15 00:41:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:06,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:06,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410892929] [2022-02-15 00:41:06,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410892929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:06,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:06,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:06,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872377937] [2022-02-15 00:41:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:06,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:06,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:06,961 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-02-15 00:41:08,973 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-02-15 00:41:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:09,183 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-02-15 00:41:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:09,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 44 [2022-02-15 00:41:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:09,186 INFO L225 Difference]: With dead ends: 222 [2022-02-15 00:41:09,186 INFO L226 Difference]: Without dead ends: 222 [2022-02-15 00:41:09,186 INFO L932 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-02-15 00:41:09,187 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:09,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 00:41:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-15 00:41:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-02-15 00:41:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.4838709677419355) internal successors, (322), 217 states have internal predecessors, (322), 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-02-15 00:41:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-02-15 00:41:09,199 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-02-15 00:41:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:09,200 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-02-15 00:41:09,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-02-15 00:41:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-02-15 00:41:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 00:41:09,206 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:09,206 INFO L514 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] [2022-02-15 00:41:09,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 00:41:09,207 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2124287227, now seen corresponding path program 1 times [2022-02-15 00:41:09,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:09,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254575313] [2022-02-15 00:41:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:09,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:09,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254575313] [2022-02-15 00:41:09,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254575313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:09,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:09,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:09,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58982731] [2022-02-15 00:41:09,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:09,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:09,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:09,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:09,437 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-02-15 00:41:11,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:11,843 INFO L93 Difference]: Finished difference Result 405 states and 600 transitions. [2022-02-15 00:41:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 59 [2022-02-15 00:41:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:11,845 INFO L225 Difference]: With dead ends: 405 [2022-02-15 00:41:11,845 INFO L226 Difference]: Without dead ends: 405 [2022-02-15 00:41:11,846 INFO L932 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-02-15 00:41:11,846 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:11,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 279 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:11,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-02-15 00:41:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 270. [2022-02-15 00:41:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.5320754716981133) internal successors, (406), 265 states have internal predecessors, (406), 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-02-15 00:41:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 410 transitions. [2022-02-15 00:41:11,871 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 410 transitions. Word has length 59 [2022-02-15 00:41:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:11,871 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 410 transitions. [2022-02-15 00:41:11,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-02-15 00:41:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 410 transitions. [2022-02-15 00:41:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-15 00:41:11,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:11,872 INFO L514 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-02-15 00:41:11,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 00:41:11,873 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:11,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1429343706, now seen corresponding path program 1 times [2022-02-15 00:41:11,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:11,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902222256] [2022-02-15 00:41:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:12,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:12,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902222256] [2022-02-15 00:41:12,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902222256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:12,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:12,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:12,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253933420] [2022-02-15 00:41:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:12,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:12,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:12,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:12,014 INFO L87 Difference]: Start difference. First operand 270 states and 410 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-02-15 00:41:14,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:14,341 INFO L93 Difference]: Finished difference Result 306 states and 464 transitions. [2022-02-15 00:41:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:14,341 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-02-15 00:41:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:14,342 INFO L225 Difference]: With dead ends: 306 [2022-02-15 00:41:14,342 INFO L226 Difference]: Without dead ends: 306 [2022-02-15 00:41:14,343 INFO L932 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-02-15 00:41:14,343 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 33 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:14,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-02-15 00:41:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 288. [2022-02-15 00:41:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.540636042402827) internal successors, (436), 283 states have internal predecessors, (436), 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-02-15 00:41:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 440 transitions. [2022-02-15 00:41:14,352 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 440 transitions. Word has length 60 [2022-02-15 00:41:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:14,352 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 440 transitions. [2022-02-15 00:41:14,352 INFO L471 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-02-15 00:41:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 440 transitions. [2022-02-15 00:41:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-15 00:41:14,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:14,353 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1] [2022-02-15 00:41:14,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 00:41:14,353 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash -355167235, now seen corresponding path program 2 times [2022-02-15 00:41:14,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:14,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434124734] [2022-02-15 00:41:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:14,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:14,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434124734] [2022-02-15 00:41:14,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434124734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:14,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:14,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:14,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593106175] [2022-02-15 00:41:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:14,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:14,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:14,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:14,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:14,580 INFO L87 Difference]: Start difference. First operand 288 states and 440 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-02-15 00:41:16,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:17,017 INFO L93 Difference]: Finished difference Result 469 states and 709 transitions. [2022-02-15 00:41:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 74 [2022-02-15 00:41:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:17,020 INFO L225 Difference]: With dead ends: 469 [2022-02-15 00:41:17,020 INFO L226 Difference]: Without dead ends: 469 [2022-02-15 00:41:17,020 INFO L932 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-02-15 00:41:17,021 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:17,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-02-15 00:41:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 310. [2022-02-15 00:41:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 305 states have internal predecessors, (465), 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-02-15 00:41:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 469 transitions. [2022-02-15 00:41:17,034 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 469 transitions. Word has length 74 [2022-02-15 00:41:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:17,034 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 469 transitions. [2022-02-15 00:41:17,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-02-15 00:41:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 469 transitions. [2022-02-15 00:41:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-15 00:41:17,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:17,035 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2022-02-15 00:41:17,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 00:41:17,036 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2014471139, now seen corresponding path program 1 times [2022-02-15 00:41:17,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:17,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056606691] [2022-02-15 00:41:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:17,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:17,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:17,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056606691] [2022-02-15 00:41:17,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056606691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:17,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:17,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:17,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490865089] [2022-02-15 00:41:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:17,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:17,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:17,199 INFO L87 Difference]: Start difference. First operand 310 states and 469 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-02-15 00:41:19,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:19,513 INFO L93 Difference]: Finished difference Result 327 states and 491 transitions. [2022-02-15 00:41:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:19,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 74 [2022-02-15 00:41:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:19,515 INFO L225 Difference]: With dead ends: 327 [2022-02-15 00:41:19,515 INFO L226 Difference]: Without dead ends: 327 [2022-02-15 00:41:19,515 INFO L932 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-02-15 00:41:19,516 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 37 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 484 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.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:19,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 484 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-02-15 00:41:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 310. [2022-02-15 00:41:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 305 states have (on average 1.521311475409836) internal successors, (464), 305 states have internal predecessors, (464), 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-02-15 00:41:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 468 transitions. [2022-02-15 00:41:19,522 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 468 transitions. Word has length 74 [2022-02-15 00:41:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:19,522 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 468 transitions. [2022-02-15 00:41:19,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-02-15 00:41:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 468 transitions. [2022-02-15 00:41:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-15 00:41:19,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:19,523 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2022-02-15 00:41:19,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 00:41:19,523 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1209548190, now seen corresponding path program 1 times [2022-02-15 00:41:19,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:19,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698515688] [2022-02-15 00:41:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:19,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:19,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698515688] [2022-02-15 00:41:19,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698515688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:19,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:19,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:19,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479074152] [2022-02-15 00:41:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:19,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:19,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:19,771 INFO L87 Difference]: Start difference. First operand 310 states and 468 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-02-15 00:41:21,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:22,146 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-02-15 00:41:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:22,147 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-02-15 00:41:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:22,148 INFO L225 Difference]: With dead ends: 327 [2022-02-15 00:41:22,148 INFO L226 Difference]: Without dead ends: 327 [2022-02-15 00:41:22,149 INFO L932 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-02-15 00:41:22,150 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 482 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.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:22,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 482 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-02-15 00:41:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 310. [2022-02-15 00:41:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 305 states have (on average 1.518032786885246) internal successors, (463), 305 states have internal predecessors, (463), 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-02-15 00:41:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 467 transitions. [2022-02-15 00:41:22,155 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 467 transitions. Word has length 75 [2022-02-15 00:41:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:22,155 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 467 transitions. [2022-02-15 00:41:22,155 INFO L471 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-02-15 00:41:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 467 transitions. [2022-02-15 00:41:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-15 00:41:22,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:22,156 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2022-02-15 00:41:22,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 00:41:22,157 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash -521867967, now seen corresponding path program 1 times [2022-02-15 00:41:22,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:22,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728939017] [2022-02-15 00:41:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:22,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:22,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728939017] [2022-02-15 00:41:22,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728939017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:22,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:22,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:22,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940887792] [2022-02-15 00:41:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:22,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:22,331 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:22,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:22,331 INFO L87 Difference]: Start difference. First operand 310 states and 467 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-02-15 00:41:24,340 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-02-15 00:41:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:24,684 INFO L93 Difference]: Finished difference Result 470 states and 703 transitions. [2022-02-15 00:41:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:24,684 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-02-15 00:41:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:24,686 INFO L225 Difference]: With dead ends: 470 [2022-02-15 00:41:24,686 INFO L226 Difference]: Without dead ends: 470 [2022-02-15 00:41:24,686 INFO L932 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-02-15 00:41:24,686 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 117 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:24,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:24,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-02-15 00:41:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 316. [2022-02-15 00:41:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.5112540192926045) internal successors, (470), 311 states have internal predecessors, (470), 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-02-15 00:41:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 474 transitions. [2022-02-15 00:41:24,692 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 474 transitions. Word has length 76 [2022-02-15 00:41:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:24,692 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 474 transitions. [2022-02-15 00:41:24,692 INFO L471 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-02-15 00:41:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 474 transitions. [2022-02-15 00:41:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-15 00:41:24,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:24,693 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2022-02-15 00:41:24,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 00:41:24,693 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1603761471, now seen corresponding path program 1 times [2022-02-15 00:41:24,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:24,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620561413] [2022-02-15 00:41:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:24,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:24,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620561413] [2022-02-15 00:41:24,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620561413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:24,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:24,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:24,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015837864] [2022-02-15 00:41:24,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:24,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:24,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:24,866 INFO L87 Difference]: Start difference. First operand 316 states and 474 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-02-15 00:41:26,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:27,257 INFO L93 Difference]: Finished difference Result 470 states and 698 transitions. [2022-02-15 00:41:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:27,258 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-02-15 00:41:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:27,259 INFO L225 Difference]: With dead ends: 470 [2022-02-15 00:41:27,260 INFO L226 Difference]: Without dead ends: 470 [2022-02-15 00:41:27,260 INFO L932 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-02-15 00:41:27,260 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 115 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:27,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-02-15 00:41:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 318. [2022-02-15 00:41:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.4984025559105432) internal successors, (469), 313 states have internal predecessors, (469), 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-02-15 00:41:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 473 transitions. [2022-02-15 00:41:27,266 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 473 transitions. Word has length 77 [2022-02-15 00:41:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:27,266 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 473 transitions. [2022-02-15 00:41:27,266 INFO L471 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-02-15 00:41:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 473 transitions. [2022-02-15 00:41:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-15 00:41:27,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:27,267 INFO L514 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-02-15 00:41:27,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 00:41:27,268 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:27,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1287469101, now seen corresponding path program 1 times [2022-02-15 00:41:27,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:27,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457923631] [2022-02-15 00:41:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-15 00:41:27,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:27,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457923631] [2022-02-15 00:41:27,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457923631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:27,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:27,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:27,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166548490] [2022-02-15 00:41:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:27,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:27,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:27,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:27,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:27,443 INFO L87 Difference]: Start difference. First operand 318 states and 473 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-02-15 00:41:29,460 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-02-15 00:41:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:29,795 INFO L93 Difference]: Finished difference Result 477 states and 709 transitions. [2022-02-15 00:41:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:29,795 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-02-15 00:41:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:29,797 INFO L225 Difference]: With dead ends: 477 [2022-02-15 00:41:29,797 INFO L226 Difference]: Without dead ends: 477 [2022-02-15 00:41:29,797 INFO L932 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-02-15 00:41:29,798 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:29,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-02-15 00:41:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2022-02-15 00:41:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 472 states have (on average 1.49364406779661) internal successors, (705), 472 states have internal predecessors, (705), 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-02-15 00:41:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 709 transitions. [2022-02-15 00:41:29,805 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 709 transitions. Word has length 78 [2022-02-15 00:41:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:29,806 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 709 transitions. [2022-02-15 00:41:29,806 INFO L471 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-02-15 00:41:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 709 transitions. [2022-02-15 00:41:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-15 00:41:29,807 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:29,807 INFO L514 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, 1] [2022-02-15 00:41:29,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 00:41:29,807 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1922297200, now seen corresponding path program 1 times [2022-02-15 00:41:29,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:29,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332583390] [2022-02-15 00:41:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:29,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:29,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332583390] [2022-02-15 00:41:29,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332583390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:29,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:29,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:29,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584225871] [2022-02-15 00:41:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:29,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:29,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:29,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:29,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:29,951 INFO L87 Difference]: Start difference. First operand 477 states and 709 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-02-15 00:41:31,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:33,348 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-02-15 00:41:35,369 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-02-15 00:41:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:35,618 INFO L93 Difference]: Finished difference Result 501 states and 741 transitions. [2022-02-15 00:41:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:35,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 79 [2022-02-15 00:41:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:35,620 INFO L225 Difference]: With dead ends: 501 [2022-02-15 00:41:35,620 INFO L226 Difference]: Without dead ends: 501 [2022-02-15 00:41:35,620 INFO L932 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-02-15 00:41:35,621 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:35,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-02-15 00:41:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-02-15 00:41:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-02-15 00:41:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 496 states have (on average 1.4858870967741935) internal successors, (737), 496 states have internal predecessors, (737), 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-02-15 00:41:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 741 transitions. [2022-02-15 00:41:35,654 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 741 transitions. Word has length 79 [2022-02-15 00:41:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:35,655 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 741 transitions. [2022-02-15 00:41:35,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-02-15 00:41:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 741 transitions. [2022-02-15 00:41:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-15 00:41:35,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:35,656 INFO L514 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-02-15 00:41:35,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 00:41:35,656 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash 323298634, now seen corresponding path program 1 times [2022-02-15 00:41:35,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:35,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757592306] [2022-02-15 00:41:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-15 00:41:35,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:35,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757592306] [2022-02-15 00:41:35,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757592306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:35,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:35,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:35,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547762326] [2022-02-15 00:41:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:35,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:35,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:35,855 INFO L87 Difference]: Start difference. First operand 501 states and 741 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-02-15 00:41:37,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:38,198 INFO L93 Difference]: Finished difference Result 644 states and 954 transitions. [2022-02-15 00:41:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:38,199 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-02-15 00:41:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:38,201 INFO L225 Difference]: With dead ends: 644 [2022-02-15 00:41:38,201 INFO L226 Difference]: Without dead ends: 644 [2022-02-15 00:41:38,201 INFO L932 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-02-15 00:41:38,201 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:38,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-02-15 00:41:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2022-02-15 00:41:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.486697965571205) internal successors, (950), 639 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-02-15 00:41:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 954 transitions. [2022-02-15 00:41:38,210 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 954 transitions. Word has length 98 [2022-02-15 00:41:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:38,211 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 954 transitions. [2022-02-15 00:41:38,211 INFO L471 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-02-15 00:41:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 954 transitions. [2022-02-15 00:41:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 00:41:38,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:38,214 INFO L514 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] [2022-02-15 00:41:38,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 00:41:38,214 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1372430939, now seen corresponding path program 1 times [2022-02-15 00:41:38,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:38,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771048176] [2022-02-15 00:41:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-15 00:41:38,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:38,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771048176] [2022-02-15 00:41:38,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771048176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:38,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:38,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:38,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754392468] [2022-02-15 00:41:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:38,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:38,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:38,385 INFO L87 Difference]: Start difference. First operand 644 states and 954 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-02-15 00:41:40,404 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-02-15 00:41:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:40,850 INFO L93 Difference]: Finished difference Result 1008 states and 1479 transitions. [2022-02-15 00:41:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 118 [2022-02-15 00:41:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:40,853 INFO L225 Difference]: With dead ends: 1008 [2022-02-15 00:41:40,853 INFO L226 Difference]: Without dead ends: 1008 [2022-02-15 00:41:40,853 INFO L932 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-02-15 00:41:40,854 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 97 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:40,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 572 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-02-15 00:41:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 728. [2022-02-15 00:41:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 723 states have (on average 1.4910096818810512) internal successors, (1078), 723 states have internal predecessors, (1078), 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-02-15 00:41:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1082 transitions. [2022-02-15 00:41:40,893 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1082 transitions. Word has length 118 [2022-02-15 00:41:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:40,893 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 1082 transitions. [2022-02-15 00:41:40,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-02-15 00:41:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1082 transitions. [2022-02-15 00:41:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-15 00:41:40,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:40,894 INFO L514 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] [2022-02-15 00:41:40,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 00:41:40,894 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash -68037210, now seen corresponding path program 1 times [2022-02-15 00:41:40,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:40,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566409949] [2022-02-15 00:41:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 00:41:41,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-15 00:41:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 00:41:42,391 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-15 00:41:42,391 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-15 00:41:42,391 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 00:41:42,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 00:41:42,395 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:42,397 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 00:41:42,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:41:42 BasicIcfg [2022-02-15 00:41:42,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 00:41:42,459 INFO L158 Benchmark]: Toolchain (without parser) took 41396.51ms. Allocated memory was 191.9MB in the beginning and 368.1MB in the end (delta: 176.2MB). Free memory was 141.2MB in the beginning and 151.3MB in the end (delta: -10.1MB). Peak memory consumption was 200.3MB. Max. memory is 8.0GB. [2022-02-15 00:41:42,459 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory was 159.8MB in the beginning and 159.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:41:42,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.65ms. Allocated memory is still 191.9MB. Free memory was 140.9MB in the beginning and 149.8MB in the end (delta: -8.9MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2022-02-15 00:41:42,459 INFO L158 Benchmark]: Boogie Preprocessor took 110.83ms. Allocated memory is still 191.9MB. Free memory was 149.8MB in the beginning and 142.9MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-02-15 00:41:42,459 INFO L158 Benchmark]: RCFGBuilder took 1816.37ms. Allocated memory was 191.9MB in the beginning and 262.1MB in the end (delta: 70.3MB). Free memory was 142.5MB in the beginning and 179.7MB in the end (delta: -37.2MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. [2022-02-15 00:41:42,459 INFO L158 Benchmark]: IcfgTransformer took 31.69ms. Allocated memory is still 262.1MB. Free memory was 179.7MB in the beginning and 175.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-02-15 00:41:42,460 INFO L158 Benchmark]: TraceAbstraction took 39032.27ms. Allocated memory was 262.1MB in the beginning and 368.1MB in the end (delta: 105.9MB). Free memory was 174.5MB in the beginning and 151.3MB in the end (delta: 23.2MB). Peak memory consumption was 162.7MB. Max. memory is 8.0GB. [2022-02-15 00:41:42,460 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.11ms. Allocated memory is still 191.9MB. Free memory was 159.8MB in the beginning and 159.6MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.65ms. Allocated memory is still 191.9MB. Free memory was 140.9MB in the beginning and 149.8MB in the end (delta: -8.9MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 110.83ms. Allocated memory is still 191.9MB. Free memory was 149.8MB in the beginning and 142.9MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1816.37ms. Allocated memory was 191.9MB in the beginning and 262.1MB in the end (delta: 70.3MB). Free memory was 142.5MB in the beginning and 179.7MB in the end (delta: -37.2MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. * IcfgTransformer took 31.69ms. Allocated memory is still 262.1MB. Free memory was 179.7MB in the beginning and 175.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 39032.27ms. Allocated memory was 262.1MB in the beginning and 368.1MB in the end (delta: 105.9MB). Free memory was 174.5MB in the beginning and 151.3MB in the end (delta: 23.2MB). Peak memory consumption was 162.7MB. 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: 1665]: 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 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967311, \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={-12:0}, SSLv3_client_data={4:0}] [L1104] BUF_MEM *buf ; [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 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->info_callback={0:-6}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] EXPR s->version VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->version=-7, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->init_buf={0:-1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->s3={-15:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->bbio={0:-10}, s->wbio={0:-9}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=1, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1346] COND FALSE !(ret <= 0) [L1351] s->hit VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1356] s->init_num = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-6}, ((s->s3)->tmp.new_cipher)->algorithms=4294967352, (s->s3)->tmp.new_cipher={-14:0}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->s3={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=3, init=1, ret=21, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:-6}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:-6}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] [L1665] reach_error() VAL [={0:-6}, blastFlag=4, init=1, ret=0, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=2, tmp___2=7, tmp___3=0, tmp___4=6, tmp___5=8, tmp___6=1, tmp___7=0, tmp___8=9, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.9s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 1048 SdHoareTripleChecker+Valid, 34.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1048 mSDsluCounter, 5341 SdHoareTripleChecker+Invalid, 32.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2906 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4534 IncrementalHoareTripleChecker+Invalid, 4788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 2435 mSDtfsCounter, 4534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=13, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 933 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1060 NumberOfCodeBlocks, 1060 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 2245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 572/572 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-02-15 00:41:42,491 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...