/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:32:15,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:32:15,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:32:15,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:32:15,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:32:15,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:32:15,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:32:15,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:32:15,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:32:15,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:32:15,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:32:15,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:32:15,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:32:15,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:32:15,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:32:15,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:32:15,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:32:15,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:32:15,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:32:15,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:32:15,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:32:15,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:32:15,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:32:15,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:32:15,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:32:15,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:32:15,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:32:15,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:32:15,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:32:15,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:32:15,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:32:15,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:32:15,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:32:15,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:32:15,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:32:15,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:32:15,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:32:15,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:32:15,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:32:15,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:32:15,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:32:15,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:32:15,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:32:15,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:32:15,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:32:15,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:32:15,989 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:32:15,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:32:15,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:32:15,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:32:15,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:32:15,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:32:15,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:32:15,990 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:32:15,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:32:15,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:32:15,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:32:15,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:32:15,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:32:15,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:32:15,991 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:32:15,992 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-04-15 11:32:16,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:32:16,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:32:16,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:32:16,183 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:32:16,183 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:32:16,184 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-04-15 11:32:16,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a720b99cb/75409090718141eb8d38491c978be6f7/FLAG45b6bd2c7 [2022-04-15 11:32:16,656 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:32:16,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.03.i.cil-1.c [2022-04-15 11:32:16,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a720b99cb/75409090718141eb8d38491c978be6f7/FLAG45b6bd2c7 [2022-04-15 11:32:17,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a720b99cb/75409090718141eb8d38491c978be6f7 [2022-04-15 11:32:17,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:32:17,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:32:17,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:32:17,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:32:17,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:32:17,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67efb19b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17, skipping insertion in model container [2022-04-15 11:32:17,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:32:17,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:32:17,375 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-04-15 11:32:17,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:32:17,410 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:32:17,519 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-04-15 11:32:17,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:32:17,539 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:32:17,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17 WrapperNode [2022-04-15 11:32:17,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:32:17,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:32:17,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:32:17,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:32:17,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:32:17,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:32:17,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:32:17,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:32:17,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (1/1) ... [2022-04-15 11:32:17,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:32:17,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:32:17,660 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-04-15 11:32:17,671 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-04-15 11:32:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:32:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:32:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:32:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:32:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:32:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:32:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:32:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:32:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:32:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:32:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:32:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:32:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:32:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:32:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:32:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:32:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:32:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:32:17,832 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:32:17,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:32:19,152 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:32:19,538 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:32:19,538 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:32:19,546 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:32:19,552 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:32:19,552 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:32:19,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:32:19 BoogieIcfgContainer [2022-04-15 11:32:19,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:32:19,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:32:19,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:32:19,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:32:19,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:32:17" (1/3) ... [2022-04-15 11:32:19,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2e3b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:32:19, skipping insertion in model container [2022-04-15 11:32:19,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:32:17" (2/3) ... [2022-04-15 11:32:19,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2e3b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:32:19, skipping insertion in model container [2022-04-15 11:32:19,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:32:19" (3/3) ... [2022-04-15 11:32:19,559 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2022-04-15 11:32:19,575 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:32:19,576 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:32:19,609 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:32:19,612 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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 [2022-04-15 11:32:19,613 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:32:19,630 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-04-15 11:32:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:32:19,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:19,639 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:19,639 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 11:32:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:19,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2024717237] [2022-04-15 11:32:19,655 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:32:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 11:32:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:19,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412854038] [2022-04-15 11:32:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:20,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 11:32:20,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:32:20,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:32:20,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:20,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141#true} is VALID [2022-04-15 11:32:20,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:32:20,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:32:20,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 11:32:20,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-15 11:32:20,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-15 11:32:20,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:20,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:20,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:20,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:20,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:20,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-15 11:32:20,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {142#false} is VALID [2022-04-15 11:32:20,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 11:32:20,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-15 11:32:20,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-15 11:32:20,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 11:32:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:32:20,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:20,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412854038] [2022-04-15 11:32:20,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412854038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:20,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:20,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:20,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2024717237] [2022-04-15 11:32:20,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2024717237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:20,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:20,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682055955] [2022-04-15 11:32:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:20,148 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-04-15 11:32:20,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:20,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 11:32:20,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:20,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:20,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:20,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:20,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:20,212 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-04-15 11:32:22,254 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-04-15 11:32:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:23,417 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 11:32:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:23,418 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-04-15 11:32:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:32:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:32:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:32:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:32:23,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:32:23,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:23,744 INFO L225 Difference]: With dead ends: 267 [2022-04-15 11:32:23,744 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 11:32:23,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:23,751 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:23,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:32:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 11:32:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 11:32:23,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:23,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second 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-04-15 11:32:23,791 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second 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-04-15 11:32:23,791 INFO L87 Difference]: Start difference. First operand 122 states. Second 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-04-15 11:32:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:23,795 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:32:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:32:23,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:23,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:23,797 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 122 states. [2022-04-15 11:32:23,797 INFO L87 Difference]: Start difference. First 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) Second operand 122 states. [2022-04-15 11:32:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:23,801 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:32:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:32:23,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:23,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:23,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:23,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:23,802 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-04-15 11:32:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 11:32:23,806 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 11:32:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:23,806 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 11:32:23,806 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:32:23,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 11:32:23,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 11:32:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:32:23,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:23,927 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:23,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:32:23,928 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 11:32:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:23,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255362749] [2022-04-15 11:32:23,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 11:32:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:23,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991177567] [2022-04-15 11:32:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:24,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 11:32:24,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:32:24,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:32:24,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:24,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1173#true} is VALID [2022-04-15 11:32:24,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:32:24,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:32:24,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 11:32:24,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-15 11:32:24,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-15 11:32:24,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-15 11:32:24,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 11:32:24,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 11:32:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:24,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:24,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991177567] [2022-04-15 11:32:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991177567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:24,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:24,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:32:24,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:24,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255362749] [2022-04-15 11:32:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255362749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:24,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:24,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:32:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131516614] [2022-04-15 11:32:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:24,166 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-04-15 11:32:24,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:24,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 11:32:24,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:24,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:32:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:32:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:32:24,207 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-04-15 11:32:26,227 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-04-15 11:32:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:26,795 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-15 11:32:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:32:26,795 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-04-15 11:32:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:32:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:32:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:32:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:32:26,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 11:32:27,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:27,126 INFO L225 Difference]: With dead ends: 327 [2022-04-15 11:32:27,126 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 11:32:27,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:32:27,128 INFO L913 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-04-15 11:32:27,128 INFO L914 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-04-15 11:32:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 11:32:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-15 11:32:27,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:27,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second 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-04-15 11:32:27,159 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second 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-04-15 11:32:27,159 INFO L87 Difference]: Start difference. First operand 222 states. Second 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-04-15 11:32:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:27,166 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:32:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:32:27,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:27,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:27,167 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 222 states. [2022-04-15 11:32:27,168 INFO L87 Difference]: Start difference. First 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) Second operand 222 states. [2022-04-15 11:32:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:27,174 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:32:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:32:27,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:27,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:27,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:27,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:27,176 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-04-15 11:32:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-15 11:32:27,183 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-15 11:32:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:27,184 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-15 11:32:27,184 INFO L479 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-04-15 11:32:27,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-15 11:32:27,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:32:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 11:32:27,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:27,416 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:27,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:32:27,417 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-15 11:32:27,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:27,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225178387] [2022-04-15 11:32:27,417 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-15 11:32:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:27,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117479575] [2022-04-15 11:32:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:27,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 11:32:27,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:32:27,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:32:27,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:27,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {2731#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2724#true} is VALID [2022-04-15 11:32:27,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:32:27,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:32:27,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-15 11:32:27,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {2724#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2724#true} is VALID [2022-04-15 11:32:27,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {2724#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2724#true} is VALID [2022-04-15 11:32:27,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {2724#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {2724#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2724#true} is VALID [2022-04-15 11:32:27,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {2724#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {2724#true} is VALID [2022-04-15 11:32:27,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2724#true} is VALID [2022-04-15 11:32:27,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:32:27,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-15 11:32:27,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {2724#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2724#true} is VALID [2022-04-15 11:32:27,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2724#true} is VALID [2022-04-15 11:32:27,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {2724#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {2724#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {2724#true} is VALID [2022-04-15 11:32:27,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-15 11:32:27,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {2724#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {2724#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {2724#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2724#true} is VALID [2022-04-15 11:32:27,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-15 11:32:27,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:32:27,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {2724#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {2724#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {2724#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {2724#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2724#true} is VALID [2022-04-15 11:32:27,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-15 11:32:27,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2724#true} is VALID [2022-04-15 11:32:27,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-15 11:32:27,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:32:27,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {2729#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2730#(= |ssl3_connect_#t~mem56| 4384)} is VALID [2022-04-15 11:32:27,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {2730#(= |ssl3_connect_#t~mem56| 4384)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:32:27,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {2725#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:32:27,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {2725#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:32:27,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {2725#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:32:27,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {2725#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:32:27,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {2725#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2725#false} is VALID [2022-04-15 11:32:27,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-15 11:32:27,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {2725#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2725#false} is VALID [2022-04-15 11:32:27,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 4 == ~blastFlag~0; {2725#false} is VALID [2022-04-15 11:32:27,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 11:32:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117479575] [2022-04-15 11:32:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117479575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:27,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:27,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:27,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225178387] [2022-04-15 11:32:27,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225178387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:27,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:27,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856297236] [2022-04-15 11:32:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:27,646 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-04-15 11:32:27,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:27,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 11:32:27,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:27,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:27,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:27,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:27,688 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-04-15 11:32:29,719 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-04-15 11:32:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:30,723 INFO L93 Difference]: Finished difference Result 363 states and 539 transitions. [2022-04-15 11:32:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:30,723 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-04-15 11:32:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:32:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:32:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:32:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 388 transitions. [2022-04-15 11:32:30,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 388 transitions. [2022-04-15 11:32:31,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:31,011 INFO L225 Difference]: With dead ends: 363 [2022-04-15 11:32:31,011 INFO L226 Difference]: Without dead ends: 258 [2022-04-15 11:32:31,011 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:31,012 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 33 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:31,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:32:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-15 11:32:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 240. [2022-04-15 11:32:31,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:31,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 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-04-15 11:32:31,022 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 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-04-15 11:32:31,023 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 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-04-15 11:32:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:31,029 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-15 11:32:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-15 11:32:31,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:31,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:31,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 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) Second operand 258 states. [2022-04-15 11:32:31,030 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 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) Second operand 258 states. [2022-04-15 11:32:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:31,036 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-04-15 11:32:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-04-15 11:32:31,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:31,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:31,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:31,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.4978723404255319) internal successors, (352), 235 states have internal predecessors, (352), 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-04-15 11:32:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-15 11:32:31,043 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-15 11:32:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:31,044 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-15 11:32:31,044 INFO L479 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-04-15 11:32:31,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-15 11:32:31,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-15 11:32:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:32:31,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:31,279 INFO L499 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] [2022-04-15 11:32:31,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:32:31,280 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-15 11:32:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:31,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740594264] [2022-04-15 11:32:41,289 WARN L232 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:32:48,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:32:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-15 11:32:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:48,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063100212] [2022-04-15 11:32:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:48,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:48,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4458#true} is VALID [2022-04-15 11:32:48,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-15 11:32:48,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-15 11:32:48,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:32:48,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4458#true} is VALID [2022-04-15 11:32:48,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-15 11:32:48,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #593#return; {4458#true} is VALID [2022-04-15 11:32:48,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret158 := main(); {4458#true} is VALID [2022-04-15 11:32:48,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {4458#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4458#true} is VALID [2022-04-15 11:32:48,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {4458#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {4458#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {4458#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {4458#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {4458#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {4458#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {4458#true} assume 12292 == #t~mem49;havoc #t~mem49; {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {4458#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {4458#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {4458#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {4458#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {4458#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {4458#true} assume !(0 == ~tmp___4~0); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {4458#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {4458#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {4458#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {4458#true} ~skip~0 := 0; {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {4458#true} assume !false; {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {4458#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {4458#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {4458#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {4458#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {4458#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {4458#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4458#true} is VALID [2022-04-15 11:32:48,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {4458#true} assume 4368 == #t~mem54;havoc #t~mem54; {4458#true} is VALID [2022-04-15 11:32:48,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {4458#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {4458#true} is VALID [2022-04-15 11:32:48,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {4458#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4458#true} is VALID [2022-04-15 11:32:48,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {4458#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:48,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:48,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:48,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:48,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:48,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {4463#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {4464#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4459#false} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {4459#false} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {4459#false} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {4459#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {4459#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4459#false} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {4459#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {4459#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {4459#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {4459#false} assume !(0 == ~tmp___4~0); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {4459#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {4459#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {4459#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {4459#false} ~skip~0 := 0; {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {4459#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {4459#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {4459#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {4459#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {4459#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,580 INFO L290 TraceCheckUtils]: 60: Hoare triple {4459#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {4459#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 62: Hoare triple {4459#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 63: Hoare triple {4459#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 64: Hoare triple {4459#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {4459#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {4459#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {4459#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {4459#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {4459#false} assume 4432 == #t~mem62;havoc #t~mem62; {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {4459#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {4459#false} assume 4 == ~blastFlag~0; {4459#false} is VALID [2022-04-15 11:32:48,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-15 11:32:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:32:48,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:48,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063100212] [2022-04-15 11:32:48,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063100212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:48,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:48,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:48,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:48,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740594264] [2022-04-15 11:32:48,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740594264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:48,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:48,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:32:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881777052] [2022-04-15 11:32:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:48,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 73 [2022-04-15 11:32:48,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:48,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:32:48,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:48,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:32:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:32:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:32:48,643 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:32:50,667 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-04-15 11:32:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:51,668 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-15 11:32:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:32:51,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 73 [2022-04-15 11:32:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:32:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:32:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:32:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:32:51,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:32:51,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:51,989 INFO L225 Difference]: With dead ends: 645 [2022-04-15 11:32:51,990 INFO L226 Difference]: Without dead ends: 421 [2022-04-15 11:32:51,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:32:51,991 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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-04-15 11:32:51,991 INFO L914 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-04-15 11:32:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-15 11:32:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-15 11:32:52,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:52,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 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-04-15 11:32:52,009 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 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-04-15 11:32:52,009 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 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-04-15 11:32:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:52,023 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:32:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:32:52,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:52,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:52,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 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) Second operand 421 states. [2022-04-15 11:32:52,024 INFO L87 Difference]: Start difference. First operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 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) Second operand 421 states. [2022-04-15 11:32:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:52,033 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:32:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:32:52,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:52,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:52,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:52,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.490272373540856) internal successors, (383), 257 states have internal predecessors, (383), 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-04-15 11:32:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-15 11:32:52,038 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-15 11:32:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:52,038 INFO L478 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-15 11:32:52,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:32:52,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-15 11:32:52,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-15 11:32:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:32:52,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:52,342 INFO L499 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] [2022-04-15 11:32:52,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:32:52,343 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:52,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-15 11:32:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:52,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808065719] [2022-04-15 11:33:06,543 WARN L232 SmtUtils]: Spent 10.44s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:33:13,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-15 11:33:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:13,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496575451] [2022-04-15 11:33:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:13,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:13,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7126#true} is VALID [2022-04-15 11:33:13,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-15 11:33:13,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-15 11:33:13,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {7126#true} call ULTIMATE.init(); {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:13,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {7133#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7126#true} is VALID [2022-04-15 11:33:13,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {7126#true} assume true; {7126#true} is VALID [2022-04-15 11:33:13,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7126#true} {7126#true} #593#return; {7126#true} is VALID [2022-04-15 11:33:13,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {7126#true} call #t~ret158 := main(); {7126#true} is VALID [2022-04-15 11:33:13,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {7126#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7126#true} is VALID [2022-04-15 11:33:13,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {7126#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7126#true} is VALID [2022-04-15 11:33:13,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {7126#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {7126#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {7126#true} is VALID [2022-04-15 11:33:13,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {7126#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {7126#true} is VALID [2022-04-15 11:33:13,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {7126#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7126#true} is VALID [2022-04-15 11:33:13,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-15 11:33:13,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {7126#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {7126#true} assume 12292 == #t~mem49;havoc #t~mem49; {7126#true} is VALID [2022-04-15 11:33:13,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {7126#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {7126#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {7126#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {7126#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {7126#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {7126#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {7126#true} assume !(0 == ~tmp___4~0); {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {7126#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {7126#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {7126#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7126#true} is VALID [2022-04-15 11:33:13,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {7126#true} ~skip~0 := 0; {7126#true} is VALID [2022-04-15 11:33:13,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {7126#true} assume !false; {7126#true} is VALID [2022-04-15 11:33:13,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {7126#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {7126#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {7126#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {7126#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {7126#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {7126#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7126#true} is VALID [2022-04-15 11:33:13,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {7126#true} assume 4368 == #t~mem54;havoc #t~mem54; {7126#true} is VALID [2022-04-15 11:33:13,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {7126#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {7126#true} is VALID [2022-04-15 11:33:13,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {7126#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7126#true} is VALID [2022-04-15 11:33:13,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {7126#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:33:13,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:33:13,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:33:13,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:33:13,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:33:13,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:33:13,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:33:13,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {7131#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7132#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {7132#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {7127#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {7127#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {7127#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 47: Hoare triple {7127#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {7127#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 49: Hoare triple {7127#false} assume !(0 == ~tmp___4~0); {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {7127#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {7127#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {7127#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {7127#false} ~skip~0 := 0; {7127#false} is VALID [2022-04-15 11:33:13,534 INFO L290 TraceCheckUtils]: 54: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {7127#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {7127#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {7127#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {7127#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 59: Hoare triple {7127#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {7127#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {7127#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {7127#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {7127#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 64: Hoare triple {7127#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {7127#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {7127#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 67: Hoare triple {7127#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {7127#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7127#false} is VALID [2022-04-15 11:33:13,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {7127#false} assume 4432 == #t~mem62;havoc #t~mem62; {7127#false} is VALID [2022-04-15 11:33:13,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {7127#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7127#false} is VALID [2022-04-15 11:33:13,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {7127#false} assume 4 == ~blastFlag~0; {7127#false} is VALID [2022-04-15 11:33:13,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {7127#false} assume !false; {7127#false} is VALID [2022-04-15 11:33:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:13,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496575451] [2022-04-15 11:33:13,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496575451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:13,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:13,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:13,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:13,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808065719] [2022-04-15 11:33:13,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808065719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:13,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:13,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076065460] [2022-04-15 11:33:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:13,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 73 [2022-04-15 11:33:13,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:13,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:33:13,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:13,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:13,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:13,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:13,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:13,596 INFO L87 Difference]: Start difference. First operand 262 states and 387 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:33:15,616 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-04-15 11:33:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:16,609 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-15 11:33:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 73 [2022-04-15 11:33:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:33:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:33:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:33:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:33:16,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:33:16,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:16,953 INFO L225 Difference]: With dead ends: 668 [2022-04-15 11:33:16,953 INFO L226 Difference]: Without dead ends: 422 [2022-04-15 11:33:16,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:16,954 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 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-04-15 11:33:16,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:33:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-15 11:33:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-15 11:33:16,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:16,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 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-04-15 11:33:16,969 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 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-04-15 11:33:16,970 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 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-04-15 11:33:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:16,979 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:33:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:33:16,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:16,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:16,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 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) Second operand 422 states. [2022-04-15 11:33:16,981 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 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) Second operand 422 states. [2022-04-15 11:33:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:16,990 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:33:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:33:16,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:16,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:16,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:16,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 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-04-15 11:33:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-15 11:33:16,996 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-15 11:33:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:16,996 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-15 11:33:16,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-04-15 11:33:16,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-15 11:33:17,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-15 11:33:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:33:17,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:17,309 INFO L499 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] [2022-04-15 11:33:17,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:33:17,310 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-15 11:33:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:17,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141551036] [2022-04-15 11:33:24,991 WARN L232 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:33:36,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:33:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-15 11:33:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:33:36,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364198400] [2022-04-15 11:33:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:33:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:33:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:33:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:33:36,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9846#true} is VALID [2022-04-15 11:33:36,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-15 11:33:36,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-15 11:33:36,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {9846#true} call ULTIMATE.init(); {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:33:36,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {9853#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9846#true} is VALID [2022-04-15 11:33:36,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {9846#true} assume true; {9846#true} is VALID [2022-04-15 11:33:36,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9846#true} {9846#true} #593#return; {9846#true} is VALID [2022-04-15 11:33:36,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {9846#true} call #t~ret158 := main(); {9846#true} is VALID [2022-04-15 11:33:36,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {9846#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9846#true} is VALID [2022-04-15 11:33:36,611 INFO L272 TraceCheckUtils]: 6: Hoare triple {9846#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {9846#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {9846#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {9846#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {9846#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {9846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {9846#true} assume 12292 == #t~mem49;havoc #t~mem49; {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {9846#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {9846#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {9846#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9846#true} is VALID [2022-04-15 11:33:36,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {9846#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {9846#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {9846#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {9846#true} assume !(0 == ~tmp___4~0); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {9846#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {9846#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {9846#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {9846#true} ~skip~0 := 0; {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {9846#true} assume !false; {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {9846#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {9846#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {9846#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {9846#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {9846#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {9846#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {9846#true} assume 4368 == #t~mem54;havoc #t~mem54; {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {9846#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {9846#true} is VALID [2022-04-15 11:33:36,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {9846#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9846#true} is VALID [2022-04-15 11:33:36,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {9846#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:33:36,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {9851#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9852#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {9852#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {9847#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 46: Hoare triple {9847#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {9847#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {9847#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {9847#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {9847#false} assume !(0 == ~tmp___4~0); {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {9847#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {9847#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {9847#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9847#false} is VALID [2022-04-15 11:33:36,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {9847#false} ~skip~0 := 0; {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {9847#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {9847#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {9847#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 59: Hoare triple {9847#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 60: Hoare triple {9847#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {9847#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {9847#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {9847#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {9847#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {9847#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {9847#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 67: Hoare triple {9847#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {9847#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {9847#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9847#false} is VALID [2022-04-15 11:33:36,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {9847#false} assume 4432 == #t~mem62;havoc #t~mem62; {9847#false} is VALID [2022-04-15 11:33:36,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {9847#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9847#false} is VALID [2022-04-15 11:33:36,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {9847#false} assume 4 == ~blastFlag~0; {9847#false} is VALID [2022-04-15 11:33:36,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {9847#false} assume !false; {9847#false} is VALID [2022-04-15 11:33:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:33:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:33:36,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364198400] [2022-04-15 11:33:36,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364198400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:36,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:36,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:36,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:33:36,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141551036] [2022-04-15 11:33:36,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141551036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:33:36,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:33:36,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:33:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666131466] [2022-04-15 11:33:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:33:36,626 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-04-15 11:33:36,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:33:36,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 11:33:36,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:36,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:33:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:33:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:33:36,682 INFO L87 Difference]: Start difference. First operand 264 states and 388 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-04-15 11:33:38,702 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-04-15 11:33:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:39,614 INFO L93 Difference]: Finished difference Result 416 states and 614 transitions. [2022-04-15 11:33:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:33:39,617 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-04-15 11:33:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:33:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:33:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:33:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:33:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-15 11:33:39,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-15 11:33:39,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:39,896 INFO L225 Difference]: With dead ends: 416 [2022-04-15 11:33:39,896 INFO L226 Difference]: Without dead ends: 281 [2022-04-15 11:33:39,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:33:39,898 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 35 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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-04-15 11:33:39,899 INFO L914 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-04-15 11:33:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-15 11:33:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-15 11:33:39,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:33:39,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 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-04-15 11:33:39,911 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 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-04-15 11:33:39,911 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 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-04-15 11:33:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:39,916 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-15 11:33:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-15 11:33:39,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:39,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:39,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 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) Second operand 281 states. [2022-04-15 11:33:39,919 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 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) Second operand 281 states. [2022-04-15 11:33:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:33:39,923 INFO L93 Difference]: Finished difference Result 281 states and 410 transitions. [2022-04-15 11:33:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2022-04-15 11:33:39,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:33:39,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:33:39,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:33:39,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:33:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4787644787644787) internal successors, (383), 259 states have internal predecessors, (383), 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-04-15 11:33:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-15 11:33:39,928 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-15 11:33:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:33:39,928 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-15 11:33:39,928 INFO L479 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-04-15 11:33:39,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-15 11:33:40,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:33:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-15 11:33:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:33:40,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:33:40,244 INFO L499 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] [2022-04-15 11:33:40,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:33:40,244 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:33:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:33:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-15 11:33:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:33:40,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677539649] [2022-04-15 11:33:55,911 WARN L232 SmtUtils]: Spent 10.64s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:34:02,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:02,729 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-15 11:34:02,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:02,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653251410] [2022-04-15 11:34:02,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:02,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:02,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11780#true} is VALID [2022-04-15 11:34:02,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-15 11:34:02,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-15 11:34:02,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {11780#true} call ULTIMATE.init(); {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {11787#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {11780#true} assume true; {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11780#true} {11780#true} #593#return; {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {11780#true} call #t~ret158 := main(); {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {11780#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {11780#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {11780#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {11780#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {11780#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {11780#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {11780#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {11780#true} assume 12292 == #t~mem49;havoc #t~mem49; {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {11780#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {11780#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {11780#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {11780#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {11780#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {11780#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {11780#true} assume !(0 == ~tmp___4~0); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {11780#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {11780#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {11780#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {11780#true} ~skip~0 := 0; {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {11780#true} assume !false; {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {11780#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {11780#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {11780#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {11780#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {11780#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {11780#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11780#true} is VALID [2022-04-15 11:34:02,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {11780#true} assume 4368 == #t~mem54;havoc #t~mem54; {11780#true} is VALID [2022-04-15 11:34:02,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {11780#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11780#true} is VALID [2022-04-15 11:34:02,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {11780#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11780#true} is VALID [2022-04-15 11:34:02,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {11780#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {11785#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11786#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {11786#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11781#false} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {11781#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {11781#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11781#false} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {11781#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {11781#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {11781#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11781#false} is VALID [2022-04-15 11:34:02,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {11781#false} assume !(0 == ~tmp___4~0); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {11781#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {11781#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {11781#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {11781#false} ~skip~0 := 0; {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {11781#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {11781#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {11781#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {11781#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {11781#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {11781#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {11781#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {11781#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {11781#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 66: Hoare triple {11781#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 67: Hoare triple {11781#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,924 INFO L290 TraceCheckUtils]: 68: Hoare triple {11781#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {11781#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {11781#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11781#false} is VALID [2022-04-15 11:34:02,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {11781#false} assume 4432 == #t~mem62;havoc #t~mem62; {11781#false} is VALID [2022-04-15 11:34:02,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {11781#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11781#false} is VALID [2022-04-15 11:34:02,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {11781#false} assume 4 == ~blastFlag~0; {11781#false} is VALID [2022-04-15 11:34:02,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {11781#false} assume !false; {11781#false} is VALID [2022-04-15 11:34:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:02,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:02,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653251410] [2022-04-15 11:34:02,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653251410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:02,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:02,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:02,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:02,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677539649] [2022-04-15 11:34:02,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677539649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:02,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:02,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120338770] [2022-04-15 11:34:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:02,927 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-04-15 11:34:02,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:02,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 11:34:02,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:02,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:02,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:02,987 INFO L87 Difference]: Start difference. First operand 264 states and 387 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-04-15 11:34:05,012 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-04-15 11:34:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:05,904 INFO L93 Difference]: Finished difference Result 416 states and 612 transitions. [2022-04-15 11:34:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:05,904 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-04-15 11:34:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:34:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:34:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:34:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 383 transitions. [2022-04-15 11:34:05,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 383 transitions. [2022-04-15 11:34:06,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:06,205 INFO L225 Difference]: With dead ends: 416 [2022-04-15 11:34:06,205 INFO L226 Difference]: Without dead ends: 281 [2022-04-15 11:34:06,205 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:06,206 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 33 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:06,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 480 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-15 11:34:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 264. [2022-04-15 11:34:06,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:06,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 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-04-15 11:34:06,216 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 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-04-15 11:34:06,216 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 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-04-15 11:34:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:06,221 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-15 11:34:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-15 11:34:06,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:06,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:06,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 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) Second operand 281 states. [2022-04-15 11:34:06,222 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 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) Second operand 281 states. [2022-04-15 11:34:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:06,227 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2022-04-15 11:34:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-04-15 11:34:06,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:06,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:06,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:06,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.4749034749034748) internal successors, (382), 259 states have internal predecessors, (382), 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-04-15 11:34:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-15 11:34:06,232 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-15 11:34:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:06,232 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-15 11:34:06,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:06,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-15 11:34:06,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-15 11:34:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:34:06,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:06,536 INFO L499 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] [2022-04-15 11:34:06,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:34:06,536 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-15 11:34:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:06,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [957338349] [2022-04-15 11:34:19,842 WARN L232 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:34:27,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-15 11:34:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:27,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933665442] [2022-04-15 11:34:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:27,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13714#true} is VALID [2022-04-15 11:34:27,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-15 11:34:27,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-15 11:34:27,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {13714#true} call ULTIMATE.init(); {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:27,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {13721#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13714#true} is VALID [2022-04-15 11:34:27,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {13714#true} assume true; {13714#true} is VALID [2022-04-15 11:34:27,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13714#true} {13714#true} #593#return; {13714#true} is VALID [2022-04-15 11:34:27,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {13714#true} call #t~ret158 := main(); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {13714#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {13714#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {13714#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {13714#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {13714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {13714#true} assume 12292 == #t~mem49;havoc #t~mem49; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {13714#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {13714#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {13714#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {13714#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {13714#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {13714#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {13714#true} assume !(0 == ~tmp___4~0); {13714#true} is VALID [2022-04-15 11:34:27,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {13714#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {13714#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {13714#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {13714#true} ~skip~0 := 0; {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {13714#true} assume !false; {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {13714#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {13714#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {13714#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {13714#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {13714#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {13714#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {13714#true} assume 4368 == #t~mem54;havoc #t~mem54; {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {13714#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {13714#true} is VALID [2022-04-15 11:34:27,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {13714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13714#true} is VALID [2022-04-15 11:34:27,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {13714#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:34:27,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {13719#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13720#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {13720#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {13715#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {13715#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {13715#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {13715#false} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 51: Hoare triple {13715#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {13715#false} assume !(0 == ~tmp___4~0); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {13715#false} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {13715#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 55: Hoare triple {13715#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {13715#false} ~skip~0 := 0; {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {13715#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {13715#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {13715#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 61: Hoare triple {13715#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {13715#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 63: Hoare triple {13715#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 64: Hoare triple {13715#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {13715#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {13715#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 67: Hoare triple {13715#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {13715#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {13715#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {13715#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {13715#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {13715#false} assume 4432 == #t~mem62;havoc #t~mem62; {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {13715#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {13715#false} assume 4 == ~blastFlag~0; {13715#false} is VALID [2022-04-15 11:34:27,795 INFO L290 TraceCheckUtils]: 75: Hoare triple {13715#false} assume !false; {13715#false} is VALID [2022-04-15 11:34:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:27,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933665442] [2022-04-15 11:34:27,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933665442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:27,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:27,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:27,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [957338349] [2022-04-15 11:34:27,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [957338349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:27,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:27,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060080986] [2022-04-15 11:34:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:27,797 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-04-15 11:34:27,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:27,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-15 11:34:27,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:27,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:27,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:27,860 INFO L87 Difference]: Start difference. First operand 264 states and 386 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-04-15 11:34:29,880 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-04-15 11:34:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:30,730 INFO L93 Difference]: Finished difference Result 407 states and 599 transitions. [2022-04-15 11:34:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:30,730 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-04-15 11:34:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:34:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:34:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-15 11:34:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 371 transitions. [2022-04-15 11:34:30,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 371 transitions. [2022-04-15 11:34:30,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:30,998 INFO L225 Difference]: With dead ends: 407 [2022-04-15 11:34:30,998 INFO L226 Difference]: Without dead ends: 272 [2022-04-15 11:34:30,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:34:30,999 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 24 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:30,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 466 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-15 11:34:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2022-04-15 11:34:31,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:31,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 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-04-15 11:34:31,014 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 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-04-15 11:34:31,015 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 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-04-15 11:34:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:31,019 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-15 11:34:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-15 11:34:31,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:31,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:31,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 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) Second operand 272 states. [2022-04-15 11:34:31,021 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 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) Second operand 272 states. [2022-04-15 11:34:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:31,026 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2022-04-15 11:34:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2022-04-15 11:34:31,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:31,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:31,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:31,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.471042471042471) internal successors, (381), 259 states have internal predecessors, (381), 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-04-15 11:34:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-15 11:34:31,031 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-15 11:34:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:31,031 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-15 11:34:31,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:31,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-15 11:34:31,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-15 11:34:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:34:31,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:31,325 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:31,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:34:31,325 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 1 times [2022-04-15 11:34:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:31,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [723818982] [2022-04-15 11:34:31,326 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1188358039, now seen corresponding path program 2 times [2022-04-15 11:34:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:31,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864740402] [2022-04-15 11:34:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:31,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15612#true} is VALID [2022-04-15 11:34:31,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-15 11:34:31,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-15 11:34:31,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {15612#true} call ULTIMATE.init(); {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:31,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {15618#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15612#true} is VALID [2022-04-15 11:34:31,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {15612#true} assume true; {15612#true} is VALID [2022-04-15 11:34:31,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15612#true} {15612#true} #593#return; {15612#true} is VALID [2022-04-15 11:34:31,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {15612#true} call #t~ret158 := main(); {15612#true} is VALID [2022-04-15 11:34:31,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {15612#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15612#true} is VALID [2022-04-15 11:34:31,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {15612#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {15612#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {15612#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {15612#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {15612#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {15612#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {15612#true} assume 12292 == #t~mem49;havoc #t~mem49; {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {15612#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {15612#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {15612#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {15612#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {15612#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {15612#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {15612#true} assume !(0 == ~tmp___4~0); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {15612#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {15612#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {15612#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {15612#true} assume 4368 == #t~mem54;havoc #t~mem54; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {15612#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {15612#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {15612#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {15612#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {15612#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {15612#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {15612#true} ~skip~0 := 0; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {15612#true} assume !false; {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {15612#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {15612#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {15612#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {15612#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {15612#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {15612#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {15612#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {15612#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {15612#true} assume 4384 == #t~mem56;havoc #t~mem56; {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {15612#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15612#true} is VALID [2022-04-15 11:34:31,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {15612#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,469 INFO L290 TraceCheckUtils]: 66: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,469 INFO L290 TraceCheckUtils]: 67: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,470 INFO L290 TraceCheckUtils]: 69: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,470 INFO L290 TraceCheckUtils]: 70: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,470 INFO L290 TraceCheckUtils]: 71: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,470 INFO L290 TraceCheckUtils]: 72: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,471 INFO L290 TraceCheckUtils]: 74: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15617#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:31,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {15617#(= 2 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {15613#false} is VALID [2022-04-15 11:34:31,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {15613#false} assume !false; {15613#false} is VALID [2022-04-15 11:34:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 11:34:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:31,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864740402] [2022-04-15 11:34:31,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864740402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:31,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:31,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:31,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:31,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [723818982] [2022-04-15 11:34:31,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [723818982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:31,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:31,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583072449] [2022-04-15 11:34:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:31,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-04-15 11:34:31,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:31,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-04-15 11:34:31,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:31,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:31,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:31,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:31,516 INFO L87 Difference]: Start difference. First operand 264 states and 385 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-04-15 11:34:33,533 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-04-15 11:34:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:34,435 INFO L93 Difference]: Finished difference Result 531 states and 783 transitions. [2022-04-15 11:34:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-04-15 11:34:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-04-15 11:34:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:34:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-04-15 11:34:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:34:34,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-15 11:34:34,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:34,763 INFO L225 Difference]: With dead ends: 531 [2022-04-15 11:34:34,764 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 11:34:34,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:34,764 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 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-04-15 11:34:34,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 11:34:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-04-15 11:34:34,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:34,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 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-04-15 11:34:34,776 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 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-04-15 11:34:34,777 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 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-04-15 11:34:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:34,784 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-15 11:34:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-15 11:34:34,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:34,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:34,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 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) Second operand 396 states. [2022-04-15 11:34:34,785 INFO L87 Difference]: Start difference. First operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 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) Second operand 396 states. [2022-04-15 11:34:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:34,792 INFO L93 Difference]: Finished difference Result 396 states and 577 transitions. [2022-04-15 11:34:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-15 11:34:34,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:34,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:34,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:34,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4654731457800512) internal successors, (573), 391 states have internal predecessors, (573), 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-04-15 11:34:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 577 transitions. [2022-04-15 11:34:34,800 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 577 transitions. Word has length 77 [2022-04-15 11:34:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:34,800 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 577 transitions. [2022-04-15 11:34:34,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-04-15 11:34:34,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 577 transitions. [2022-04-15 11:34:35,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2022-04-15 11:34:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 11:34:35,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:35,232 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:35,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:34:35,233 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 1 times [2022-04-15 11:34:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:35,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009883945] [2022-04-15 11:34:35,234 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -979274608, now seen corresponding path program 2 times [2022-04-15 11:34:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:35,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020047103] [2022-04-15 11:34:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:35,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18267#true} is VALID [2022-04-15 11:34:35,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-15 11:34:35,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-15 11:34:35,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {18267#true} call ULTIMATE.init(); {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:35,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {18273#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18267#true} is VALID [2022-04-15 11:34:35,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {18267#true} assume true; {18267#true} is VALID [2022-04-15 11:34:35,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18267#true} {18267#true} #593#return; {18267#true} is VALID [2022-04-15 11:34:35,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {18267#true} call #t~ret158 := main(); {18267#true} is VALID [2022-04-15 11:34:35,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {18267#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {18267#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {18267#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {18267#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {18267#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {18267#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {18267#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {18267#true} assume 12292 == #t~mem49;havoc #t~mem49; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {18267#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {18267#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {18267#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {18267#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {18267#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {18267#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {18267#true} assume !(0 == ~tmp___4~0); {18267#true} is VALID [2022-04-15 11:34:35,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {18267#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {18267#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {18267#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {18267#true} ~skip~0 := 0; {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {18267#true} assume !false; {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {18267#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {18267#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {18267#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {18267#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {18267#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {18267#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {18267#true} assume 4368 == #t~mem54;havoc #t~mem54; {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {18267#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {18267#true} is VALID [2022-04-15 11:34:35,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {18267#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {18272#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:34:35,364 INFO L290 TraceCheckUtils]: 51: Hoare triple {18272#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {18268#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {18268#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {18268#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 55: Hoare triple {18268#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {18268#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {18268#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {18268#false} ~skip~0 := 0; {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 59: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {18268#false} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {18268#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {18268#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {18268#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {18268#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {18268#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {18268#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {18268#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {18268#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {18268#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {18268#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {18268#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {18268#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 73: Hoare triple {18268#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {18268#false} assume 4432 == #t~mem62;havoc #t~mem62; {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {18268#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 76: Hoare triple {18268#false} assume 4 == ~blastFlag~0; {18268#false} is VALID [2022-04-15 11:34:35,366 INFO L290 TraceCheckUtils]: 77: Hoare triple {18268#false} assume !false; {18268#false} is VALID [2022-04-15 11:34:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:34:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:35,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020047103] [2022-04-15 11:34:35,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020047103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:35,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:35,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:35,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:35,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009883945] [2022-04-15 11:34:35,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009883945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:35,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:35,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559204765] [2022-04-15 11:34:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:35,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 11:34:35,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:35,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:35,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:35,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:35,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:35,434 INFO L87 Difference]: Start difference. First operand 396 states and 577 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:37,450 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-04-15 11:34:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:38,068 INFO L93 Difference]: Finished difference Result 687 states and 1003 transitions. [2022-04-15 11:34:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 11:34:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:34:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:34:38,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-15 11:34:38,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:38,309 INFO L225 Difference]: With dead ends: 687 [2022-04-15 11:34:38,309 INFO L226 Difference]: Without dead ends: 420 [2022-04-15 11:34:38,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:38,310 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:38,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 359 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:34:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-15 11:34:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-04-15 11:34:38,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:38,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 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-04-15 11:34:38,321 INFO L74 IsIncluded]: Start isIncluded. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 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-04-15 11:34:38,322 INFO L87 Difference]: Start difference. First operand 420 states. Second operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 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-04-15 11:34:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:38,329 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:34:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:34:38,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:38,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:38,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 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) Second operand 420 states. [2022-04-15 11:34:38,330 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 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) Second operand 420 states. [2022-04-15 11:34:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:38,337 INFO L93 Difference]: Finished difference Result 420 states and 609 transitions. [2022-04-15 11:34:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:34:38,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:38,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:38,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:38,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4578313253012047) internal successors, (605), 415 states have internal predecessors, (605), 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-04-15 11:34:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 609 transitions. [2022-04-15 11:34:38,346 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 609 transitions. Word has length 78 [2022-04-15 11:34:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:38,346 INFO L478 AbstractCegarLoop]: Abstraction has 420 states and 609 transitions. [2022-04-15 11:34:38,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:34:38,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 420 states and 609 transitions. [2022-04-15 11:34:38,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 609 transitions. [2022-04-15 11:34:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 11:34:38,795 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:38,795 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:38,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:34:38,796 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 1 times [2022-04-15 11:34:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:38,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117750601] [2022-04-15 11:34:38,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1809534672, now seen corresponding path program 2 times [2022-04-15 11:34:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:38,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126665398] [2022-04-15 11:34:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:38,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21330#true} is VALID [2022-04-15 11:34:38,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-15 11:34:38,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-15 11:34:38,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {21330#true} call ULTIMATE.init(); {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:34:38,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {21336#(and (= |~#SSLv3_client_data~0.base| |old(~#SSLv3_client_data~0.base)|) (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |~#SSLv3_client_data~0.offset| |old(~#SSLv3_client_data~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21330#true} is VALID [2022-04-15 11:34:38,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {21330#true} assume true; {21330#true} is VALID [2022-04-15 11:34:38,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21330#true} {21330#true} #593#return; {21330#true} is VALID [2022-04-15 11:34:38,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {21330#true} call #t~ret158 := main(); {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {21330#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {21330#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {21330#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~tmp~2;havoc ~l~0;havoc ~num1~0;havoc ~cb~0.base, ~cb~0.offset;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {21330#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 4294967296;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {21330#true} call #t~mem47 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 28 + ~s.offset, 4);havoc #t~mem47; {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {21330#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:34:38,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {21330#true} assume 12292 == #t~mem49;havoc #t~mem49; {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {21330#true} call write~int(1, ~s.base, 40 + ~s.offset, 4);call write~int(4096, ~s.base, 52 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem83 := read~int(#t~mem82.base, 64 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 64 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {21330#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {21330#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {21330#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {21330#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {21330#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {21330#true} assume !(0 == ~tmp___4~0); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {21330#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 52 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem88 := read~int(#t~mem87.base, 60 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 60 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 64 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {21330#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {21330#true} assume 4368 == #t~mem54;havoc #t~mem54; {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {21330#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {21330#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {21330#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 20 + ~s.offset, 4);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 16 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {21330#true} assume (#t~mem90.base + #t~mem90.offset) % 4294967296 != (#t~mem91.base + #t~mem91.offset) % 4294967296;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {21330#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {21330#true} assume 4384 == #t~mem56;havoc #t~mem56; {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {21330#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {21330#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {21330#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {21330#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {21330#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {21330#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {21330#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {21330#true} ~skip~0 := 0; {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {21330#true} assume !false; {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {21330#true} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {21330#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {21330#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {21330#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {21330#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {21330#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {21330#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {21330#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {21330#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {21330#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {21330#true} assume 4400 == #t~mem58;havoc #t~mem58; {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {21330#true} call #t~mem94.base, #t~mem94.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem95.base, #t~mem95.offset := read~$Pointer$(#t~mem94.base, 836 + #t~mem94.offset, 4);call #t~mem96 := read~int(#t~mem95.base, 12 + #t~mem95.offset, 4); {21330#true} is VALID [2022-04-15 11:34:38,977 INFO L290 TraceCheckUtils]: 71: Hoare triple {21330#true} assume !(0 != (if 0 == #t~mem96 then 0 else (if 1 == #t~mem96 then 0 else ~bitwiseAnd(#t~mem96, 256))) % 4294967296);havoc #t~mem94.base, #t~mem94.offset;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96;assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {21330#true} is VALID [2022-04-15 11:34:38,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {21330#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,988 INFO L290 TraceCheckUtils]: 74: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,988 INFO L290 TraceCheckUtils]: 75: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem148 := read~int(#t~mem147.base, 848 + #t~mem147.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,988 INFO L290 TraceCheckUtils]: 76: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,989 INFO L290 TraceCheckUtils]: 77: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,989 INFO L290 TraceCheckUtils]: 78: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,990 INFO L290 TraceCheckUtils]: 82: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,990 INFO L290 TraceCheckUtils]: 83: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,990 INFO L290 TraceCheckUtils]: 84: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,990 INFO L290 TraceCheckUtils]: 85: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,991 INFO L290 TraceCheckUtils]: 86: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,991 INFO L290 TraceCheckUtils]: 87: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,991 INFO L290 TraceCheckUtils]: 88: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,991 INFO L290 TraceCheckUtils]: 89: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,992 INFO L290 TraceCheckUtils]: 90: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,992 INFO L290 TraceCheckUtils]: 91: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,992 INFO L290 TraceCheckUtils]: 92: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,992 INFO L290 TraceCheckUtils]: 93: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,993 INFO L290 TraceCheckUtils]: 94: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {21335#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:34:38,993 INFO L290 TraceCheckUtils]: 95: Hoare triple {21335#(= 3 ssl3_connect_~blastFlag~0)} assume 4 == ~blastFlag~0; {21331#false} is VALID [2022-04-15 11:34:38,993 INFO L290 TraceCheckUtils]: 96: Hoare triple {21331#false} assume !false; {21331#false} is VALID [2022-04-15 11:34:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 11:34:38,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:38,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126665398] [2022-04-15 11:34:38,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126665398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:38,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:38,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:38,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:38,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117750601] [2022-04-15 11:34:38,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117750601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:38,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:38,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:38,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078271887] [2022-04-15 11:34:38,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:38,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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 97 [2022-04-15 11:34:38,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:38,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04-15 11:34:39,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:39,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:39,053 INFO L87 Difference]: Start difference. First operand 420 states and 609 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04-15 11:34:41,071 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-04-15 11:34:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:41,938 INFO L93 Difference]: Finished difference Result 842 states and 1230 transitions. [2022-04-15 11:34:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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 97 [2022-04-15 11:34:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04-15 11:34:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:34:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04-15 11:34:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:34:41,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 11:34:42,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:42,255 INFO L225 Difference]: With dead ends: 842 [2022-04-15 11:34:42,255 INFO L226 Difference]: Without dead ends: 551 [2022-04-15 11:34:42,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:42,256 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 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-04-15 11:34:42,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 476 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:34:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-15 11:34:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2022-04-15 11:34:42,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:42,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 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-04-15 11:34:42,268 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 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-04-15 11:34:42,269 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 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-04-15 11:34:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:42,279 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:34:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:34:42,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:42,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:42,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 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) Second operand 551 states. [2022-04-15 11:34:42,282 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 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) Second operand 551 states. [2022-04-15 11:34:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:42,292 INFO L93 Difference]: Finished difference Result 551 states and 800 transitions. [2022-04-15 11:34:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:34:42,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:42,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:42,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:42,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4578754578754578) internal successors, (796), 546 states have internal predecessors, (796), 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-04-15 11:34:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 800 transitions. [2022-04-15 11:34:42,305 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 800 transitions. Word has length 97 [2022-04-15 11:34:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:42,305 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 800 transitions. [2022-04-15 11:34:42,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 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-04-15 11:34:42,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 800 transitions. [2022-04-15 11:34:42,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 800 edges. 800 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:34:42,874 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 800 transitions. [2022-04-15 11:34:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:34:42,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:42,875 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:34:42,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:34:42,876 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 1 times [2022-04-15 11:34:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471666901] [2022-04-15 11:34:42,876 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:42,877 INFO L85 PathProgramCache]: Analyzing trace with hash -120492913, now seen corresponding path program 2 times [2022-04-15 11:34:42,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:42,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654507379] [2022-04-15 11:34:42,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:34:43,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 11:34:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 11:34:44,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 11:34:44,214 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 11:34:44,214 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 11:34:44,218 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:34:44,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:34:44,222 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 11:34:44,224 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-15 11:34:44,263 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-15 11:34:44,264 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 11:34:44,265 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1316-2 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 11:34:44,266 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1328 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1337 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1340-2 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1340-2 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1340 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1340 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1360-2 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-15 11:34:44,267 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-15 11:34:44,268 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-15 11:34:44,269 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-15 11:34:44,270 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-15 11:34:44,271 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 11:34:44,272 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-15 11:34:44,272 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 11:34:44,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:34:44 BoogieIcfgContainer [2022-04-15 11:34:44,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:34:44,276 INFO L158 Benchmark]: Toolchain (without parser) took 147264.38ms. Allocated memory was 184.5MB in the beginning and 286.3MB in the end (delta: 101.7MB). Free memory was 130.3MB in the beginning and 155.2MB in the end (delta: -25.0MB). Peak memory consumption was 147.5MB. Max. memory is 8.0GB. [2022-04-15 11:34:44,276 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:34:44,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.97ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 130.1MB in the beginning and 192.1MB in the end (delta: -62.0MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-15 11:34:44,277 INFO L158 Benchmark]: Boogie Preprocessor took 83.29ms. Allocated memory is still 238.0MB. Free memory was 191.6MB in the beginning and 182.6MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 11:34:44,277 INFO L158 Benchmark]: RCFGBuilder took 1929.62ms. Allocated memory is still 238.0MB. Free memory was 182.6MB in the beginning and 179.8MB in the end (delta: 2.9MB). Peak memory consumption was 77.8MB. Max. memory is 8.0GB. [2022-04-15 11:34:44,281 INFO L158 Benchmark]: TraceAbstraction took 144720.54ms. Allocated memory was 238.0MB in the beginning and 286.3MB in the end (delta: 48.2MB). Free memory was 179.3MB in the beginning and 155.2MB in the end (delta: 24.0MB). Peak memory consumption was 142.4MB. Max. memory is 8.0GB. [2022-04-15 11:34:44,281 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 518.97ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 130.1MB in the beginning and 192.1MB in the end (delta: -62.0MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.29ms. Allocated memory is still 238.0MB. Free memory was 191.6MB in the beginning and 182.6MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1929.62ms. Allocated memory is still 238.0MB. Free memory was 182.6MB in the beginning and 179.8MB in the end (delta: 2.9MB). Peak memory consumption was 77.8MB. Max. memory is 8.0GB. * TraceAbstraction took 144720.54ms. Allocated memory was 238.0MB in the beginning and 286.3MB in the end (delta: 48.2MB). Free memory was 179.3MB in the beginning and 155.2MB in the end (delta: 24.0MB). Peak memory consumption was 142.4MB. Max. memory is 8.0GB. * 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 ; [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) [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 [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) [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [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 [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1271] EXPR s->version [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) [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 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 [L1346] COND FALSE !(ret <= 0) [L1351] s->hit [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 [L1356] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [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 [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 [L1369] COND FALSE !(ret <= 0) [L1375] s->state = 4416 [L1376] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 [L1393] COND FALSE !(! tmp___6) [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 [L1665] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 144.6s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 754 SdHoareTripleChecker+Valid, 25.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 754 mSDsluCounter, 4674 SdHoareTripleChecker+Invalid, 25.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2487 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3549 IncrementalHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 2187 mSDtfsCounter, 3549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=551occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 378 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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-04-15 11:34:44,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...