/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.04.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:34:46,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:34:46,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:34:46,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:34:46,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:34:46,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:34:46,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:34:46,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:34:46,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:34:46,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:34:46,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:34:46,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:34:46,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:34:46,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:34:46,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:34:46,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:34:46,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:34:46,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:34:47,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:34:47,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:34:47,003 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:34:47,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:34:47,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:34:47,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:34:47,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:34:47,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:34:47,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:34:47,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:34:47,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:34:47,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:34:47,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:34:47,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:34:47,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:34:47,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:34:47,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:34:47,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:34:47,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:34:47,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:34:47,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:34:47,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:34:47,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:34:47,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:34:47,018 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:34:47,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:34:47,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:34:47,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:34:47,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:34:47,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:34:47,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:34:47,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:34:47,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:34:47,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:34:47,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:34:47,028 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:34:47,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:34:47,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:34:47,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:34:47,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:34:47,030 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:34:47,030 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:34:47,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:34:47,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:34:47,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:34:47,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:34:47,201 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:34:47,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-15 11:34:47,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a12dc010/2edf335cce0443d08c3747314ab2622e/FLAGdeb247cfb [2022-04-15 11:34:47,696 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:34:47,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-15 11:34:47,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a12dc010/2edf335cce0443d08c3747314ab2622e/FLAGdeb247cfb [2022-04-15 11:34:47,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a12dc010/2edf335cce0443d08c3747314ab2622e [2022-04-15 11:34:47,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:34:47,725 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:34:47,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:34:47,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:34:47,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:34:47,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:34:47" (1/1) ... [2022-04-15 11:34:47,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82275b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:47, skipping insertion in model container [2022-04-15 11:34:47,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:34:47" (1/1) ... [2022-04-15 11:34:47,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:34:47,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:34:48,054 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.04.i.cil-2.c[65405,65418] [2022-04-15 11:34:48,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:34:48,083 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:34:48,180 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.04.i.cil-2.c[65405,65418] [2022-04-15 11:34:48,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:34:48,194 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:34:48,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48 WrapperNode [2022-04-15 11:34:48,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:34:48,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:34:48,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:34:48,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:34:48,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:34:48,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:34:48,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:34:48,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:34:48,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (1/1) ... [2022-04-15 11:34:48,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:34:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:34:48,343 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:34:48,367 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:34:48,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:34:48,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:34:48,395 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:34:48,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-15 11:34:48,395 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-15 11:34:48,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:34:48,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-15 11:34:48,396 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:34:48,396 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:34:48,396 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:34:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:34:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:34:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:34:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:34:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:34:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:34:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:34:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:34:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:34:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:34:48,556 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:34:48,557 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:34:49,844 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:34:50,252 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-15 11:34:50,252 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-15 11:34:50,271 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:34:50,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:34:50,277 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:34:50,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:34:50 BoogieIcfgContainer [2022-04-15 11:34:50,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:34:50,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:34:50,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:34:50,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:34:50,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:34:47" (1/3) ... [2022-04-15 11:34:50,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583ae9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:34:50, skipping insertion in model container [2022-04-15 11:34:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:34:48" (2/3) ... [2022-04-15 11:34:50,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583ae9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:34:50, skipping insertion in model container [2022-04-15 11:34:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:34:50" (3/3) ... [2022-04-15 11:34:50,284 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2022-04-15 11:34:50,287 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:34:50,287 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:34:50,322 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:34:50,334 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:34:50,335 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:34:50,353 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:34:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 11:34:50,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:50,364 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:34:50,364 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-15 11:34:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:50,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1949252426] [2022-04-15 11:34:50,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:34:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-15 11:34:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:50,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328332412] [2022-04-15 11:34:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:50,926 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:34:50,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:34:50,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:34:50,928 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:34:50,929 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:34:50,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-15 11:34:50,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-15 11:34:50,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-15 11:34:50,933 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:34:50,933 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:34:50,936 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:34:50,937 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:34:50,938 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:34:50,938 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:34:50,939 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:34:50,941 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:34:50,941 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:34:50,941 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:34:50,942 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:34:50,943 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:34:50,943 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:34:50,944 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:34:50,944 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:34:50,944 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:34:50,945 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:34:50,945 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:34:50,946 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:34:50,946 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:34:50,947 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:34:50,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-15 11:34:50,948 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:34:50,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-15 11:34:50,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-15 11:34:50,951 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:34:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:50,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328332412] [2022-04-15 11:34:50,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328332412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:50,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:50,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:50,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1949252426] [2022-04-15 11:34:50,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1949252426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:50,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:50,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174577481] [2022-04-15 11:34:50,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:50,965 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:34:50,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:50,969 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:34:51,016 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:34:51,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:51,039 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:34:53,093 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:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:54,137 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-15 11:34:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:34:54,137 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:34:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:54,138 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:34:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:34:54,152 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:34:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-15 11:34:54,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-15 11:34:54,460 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:34:54,468 INFO L225 Difference]: With dead ends: 267 [2022-04-15 11:34:54,468 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 11:34:54,470 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:34:54,472 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:34:54,472 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.3s Time] [2022-04-15 11:34:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 11:34:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 11:34:54,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:54,498 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:34:54,498 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:34:54,499 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:34:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:54,503 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:34:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:34:54,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:54,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:54,504 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:34:54,504 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:34:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:54,508 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-15 11:34:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-15 11:34:54,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:54,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:54,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:54,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:54,509 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:34:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-15 11:34:54,513 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-15 11:34:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:54,514 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-15 11:34:54,514 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:34:54,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-15 11:34:54,636 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:34:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-15 11:34:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 11:34:54,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:54,638 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:34:54,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:34:54,639 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-15 11:34:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:54,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120765740] [2022-04-15 11:34:54,640 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-15 11:34:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:54,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695763200] [2022-04-15 11:34:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:54,885 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:34:54,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:34:54,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:34:54,886 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:34:54,886 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:34:54,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-15 11:34:54,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-15 11:34:54,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-15 11:34:54,887 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:34:54,887 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:34:54,888 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:34:54,888 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:34:54,889 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:34:54,889 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:34:54,889 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:34:54,889 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:34:54,892 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:34:54,892 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:34:54,893 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:34:54,893 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:34:54,894 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:34:54,894 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:34:54,895 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:34:54,896 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:34:54,896 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:34:54,896 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:34:54,897 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:34:54,897 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:34:54,898 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:34:54,898 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:34:54,898 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:34:54,899 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:34:54,899 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:34:54,899 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:34:54,900 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:34:54,900 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:34:54,900 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:34:54,901 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:34:54,901 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:34:54,901 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:34:54,901 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:34:54,902 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:34:54,902 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:34:54,902 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:34:54,903 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:34:54,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-15 11:34:54,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-15 11:34:54,904 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:34:54,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:54,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695763200] [2022-04-15 11:34:54,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695763200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:54,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:54,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:54,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:54,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120765740] [2022-04-15 11:34:54,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120765740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:54,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:54,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:34:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016324850] [2022-04-15 11:34:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:54,906 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:34:54,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:54,907 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:34:54,939 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:34:54,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:34:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:54,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:34:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:34:54,945 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:34:56,963 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:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:57,538 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-15 11:34:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:34:57,538 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:34:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:34:57,539 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:34:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:57,543 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:34:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:34:57,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 11:34:57,861 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:34:57,866 INFO L225 Difference]: With dead ends: 327 [2022-04-15 11:34:57,866 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 11:34:57,866 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:57,867 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:34:57,867 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:34:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 11:34:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-15 11:34:57,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:34:57,878 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:34:57,879 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:34:57,879 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:34:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:57,885 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:34:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:57,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:57,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:57,886 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:34:57,887 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:34:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:34:57,893 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-15 11:34:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:57,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:34:57,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:34:57,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:34:57,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:34:57,894 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:34:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-15 11:34:57,904 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-15 11:34:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:34:57,904 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-15 11:34:57,904 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:34:57,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-15 11:34:58,125 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:34:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-15 11:34:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 11:34:58,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:34:58,127 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:34:58,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:34:58,127 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:34:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:34:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-15 11:34:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:58,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935377842] [2022-04-15 11:34:58,128 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:34:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-15 11:34:58,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:34:58,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62498986] [2022-04-15 11:34:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:34:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:34:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:34:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:34:58,303 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:34:58,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:34:58,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:34:58,304 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:34:58,304 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:34:58,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-15 11:34:58,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-15 11:34:58,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-15 11:34:58,305 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:34:58,305 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:34:58,305 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:34:58,305 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:34:58,305 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:34:58,305 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:34:58,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:34:58,305 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:34:58,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-15 11:34:58,306 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:34:58,306 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:34:58,306 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:34:58,306 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:34:58,306 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:34:58,306 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:34:58,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-15 11:34:58,306 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:34:58,307 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:34:58,307 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:34:58,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-15 11:34:58,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-15 11:34:58,307 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:34:58,307 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:34:58,307 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:34:58,307 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:34:58,307 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:34:58,308 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:34:58,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-15 11:34:58,308 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:34:58,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-15 11:34:58,310 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:34:58,316 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:34:58,319 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:34:58,319 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:34:58,319 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:34:58,320 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:34:58,320 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:34:58,321 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:34:58,322 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:34:58,322 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:34:58,322 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:34:58,323 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:34:58,323 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:34:58,323 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:34:58,324 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:34:58,324 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:34:58,324 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:34:58,324 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:34:58,324 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:34:58,324 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:34:58,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-15 11:34:58,324 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:34:58,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-15 11:34:58,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-15 11:34:58,328 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:34:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:34:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62498986] [2022-04-15 11:34:58,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62498986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:58,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:58,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:58,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:34:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935377842] [2022-04-15 11:34:58,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935377842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:34:58,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:34:58,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:34:58,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595477692] [2022-04-15 11:34:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:34:58,330 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:34:58,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:34:58,331 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:34:58,375 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:34:58,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:34:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:34:58,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:34:58,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:34:58,376 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:35:00,396 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:35:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:01,367 INFO L93 Difference]: Finished difference Result 362 states and 537 transitions. [2022-04-15 11:35:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:01,367 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:35:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:01,367 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:35:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:35:01,370 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:35:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-15 11:35:01,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-15 11:35:01,603 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:35:01,606 INFO L225 Difference]: With dead ends: 362 [2022-04-15 11:35:01,607 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 11:35:01,607 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:35:01,608 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:01,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 359 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:35:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 11:35:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-15 11:35:01,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:01,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 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:35:01,621 INFO L74 IsIncluded]: Start isIncluded. First operand 257 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:35:01,621 INFO L87 Difference]: Start difference. First operand 257 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:35:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:01,627 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-15 11:35:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-15 11:35:01,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:01,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:01,628 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 257 states. [2022-04-15 11:35:01,628 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 257 states. [2022-04-15 11:35:01,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:01,634 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-15 11:35:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-15 11:35:01,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:01,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:01,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:01,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:01,635 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:35:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-15 11:35:01,641 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-15 11:35:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:01,641 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-15 11:35:01,641 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:35:01,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-15 11:35:01,867 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:35:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-15 11:35:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:35:01,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:01,868 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:35:01,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:35:01,868 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:01,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-15 11:35:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:01,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531602417] [2022-04-15 11:35:17,226 WARN L232 SmtUtils]: Spent 15.35s 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:35:25,028 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-15 11:35:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:25,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348415404] [2022-04-15 11:35:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:25,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {4461#(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); {4454#true} is VALID [2022-04-15 11:35:25,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-15 11:35:25,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {4454#true} call ULTIMATE.init(); {4461#(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:35:25,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4461#(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); {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#true} call #t~ret158 := main(); {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {4454#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {4454#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4454#true} is VALID [2022-04-15 11:35:25,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#true} assume 12292 == #t~mem49;havoc #t~mem49; {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {4454#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {4454#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {4454#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {4454#true} assume !(0 == ~tmp___4~0); {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:25,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {4454#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4454#true} is VALID [2022-04-15 11:35:25,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {4454#true} ~skip~0 := 0; {4454#true} is VALID [2022-04-15 11:35:25,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-15 11:35:25,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {4454#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); {4454#true} is VALID [2022-04-15 11:35:25,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {4454#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:25,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {4454#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:25,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {4454#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:25,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {4454#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:25,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {4454#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4454#true} is VALID [2022-04-15 11:35:25,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {4454#true} assume 4368 == #t~mem54;havoc #t~mem54; {4454#true} is VALID [2022-04-15 11:35:25,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {4454#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; {4454#true} is VALID [2022-04-15 11:35:25,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {4454#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4454#true} is VALID [2022-04-15 11:35:25,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {4454#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); {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:25,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {4459#(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; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:25,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {4459#(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); {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:25,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {4459#(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; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:25,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:25,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4459#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:25,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {4459#(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); {4460#(not (= 12292 |ssl3_connect_#t~mem49|))} is VALID [2022-04-15 11:35:25,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {4460#(not (= 12292 |ssl3_connect_#t~mem49|))} assume 12292 == #t~mem49;havoc #t~mem49; {4455#false} is VALID [2022-04-15 11:35:25,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {4455#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; {4455#false} is VALID [2022-04-15 11:35:25,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {4455#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {4455#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {4455#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {4455#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {4455#false} assume !(0 == ~tmp___4~0); {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {4455#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {4455#false} ~skip~0 := 0; {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {4455#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); {4455#false} is VALID [2022-04-15 11:35:25,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {4455#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {4455#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {4455#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {4455#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {4455#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {4455#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {4455#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {4455#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {4455#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {4455#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {4455#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {4455#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {4455#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4455#false} is VALID [2022-04-15 11:35:25,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {4455#false} assume 4432 == #t~mem62;havoc #t~mem62; {4455#false} is VALID [2022-04-15 11:35:25,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {4455#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {4455#false} is VALID [2022-04-15 11:35:25,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {4455#false} assume 5 == ~blastFlag~0; {4455#false} is VALID [2022-04-15 11:35:25,251 INFO L290 TraceCheckUtils]: 72: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-15 11:35:25,251 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:35:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:25,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348415404] [2022-04-15 11:35:25,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348415404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:25,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:25,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:25,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:25,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531602417] [2022-04-15 11:35:25,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531602417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:25,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:25,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638391007] [2022-04-15 11:35:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:25,253 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:35:25,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:25,255 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:35:25,300 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:35:25,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:25,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:25,301 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:35:27,323 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:35:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:28,217 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-15 11:35:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:28,217 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:35:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:28,218 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:35:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:28,221 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:35:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:35:28,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:35:28,552 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:35:28,569 INFO L225 Difference]: With dead ends: 645 [2022-04-15 11:35:28,569 INFO L226 Difference]: Without dead ends: 421 [2022-04-15 11:35:28,570 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:35:28,570 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:28,571 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.3s Time] [2022-04-15 11:35:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-15 11:35:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-15 11:35:28,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:28,588 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:35:28,589 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:35:28,589 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:35:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:28,605 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:35:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:35:28,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:28,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:28,607 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:35:28,607 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:35:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:28,616 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-15 11:35:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-15 11:35:28,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:28,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:28,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:28,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:28,617 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:35:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-15 11:35:28,623 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-15 11:35:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:28,623 INFO L478 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-15 11:35:28,623 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:35:28,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-15 11:35:28,916 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:35:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-15 11:35:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 11:35:28,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:28,918 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:35:28,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:35:28,918 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-15 11:35:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:28,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1441181900] [2022-04-15 11:35:41,792 WARN L232 SmtUtils]: Spent 8.55s 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:35:48,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:35:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-15 11:35:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:48,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780359188] [2022-04-15 11:35:48,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:48,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:48,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:48,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {7129#(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); {7122#true} is VALID [2022-04-15 11:35:48,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-15 11:35:48,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-15 11:35:48,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {7122#true} call ULTIMATE.init(); {7129#(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:35:48,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {7129#(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); {7122#true} is VALID [2022-04-15 11:35:48,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-15 11:35:48,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-15 11:35:48,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {7122#true} call #t~ret158 := main(); {7122#true} is VALID [2022-04-15 11:35:48,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {7122#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {7122#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:48,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {7122#true} assume 12292 == #t~mem49;havoc #t~mem49; {7122#true} is VALID [2022-04-15 11:35:48,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:48,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {7122#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:48,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {7122#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7122#true} is VALID [2022-04-15 11:35:48,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {7122#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:48,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:48,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {7122#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7122#true} is VALID [2022-04-15 11:35:48,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {7122#true} assume !(0 == ~tmp___4~0); {7122#true} is VALID [2022-04-15 11:35:48,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:48,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:48,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {7122#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7122#true} is VALID [2022-04-15 11:35:48,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {7122#true} ~skip~0 := 0; {7122#true} is VALID [2022-04-15 11:35:48,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-15 11:35:48,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {7122#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); {7122#true} is VALID [2022-04-15 11:35:48,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {7122#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:48,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {7122#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:48,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {7122#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:48,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {7122#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:48,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {7122#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7122#true} is VALID [2022-04-15 11:35:48,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {7122#true} assume 4368 == #t~mem54;havoc #t~mem54; {7122#true} is VALID [2022-04-15 11:35:48,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {7122#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; {7122#true} is VALID [2022-04-15 11:35:48,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {7122#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7122#true} is VALID [2022-04-15 11:35:48,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {7122#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); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:48,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {7127#(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; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:48,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {7127#(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); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:48,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {7127#(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; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:48,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:48,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:48,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {7127#(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); {7127#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:35:48,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {7127#(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); {7128#(not (= |ssl3_connect_#t~mem50| 16384))} is VALID [2022-04-15 11:35:48,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {7128#(not (= |ssl3_connect_#t~mem50| 16384))} assume 16384 == #t~mem50;havoc #t~mem50; {7123#false} is VALID [2022-04-15 11:35:48,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {7123#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {7123#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7123#false} is VALID [2022-04-15 11:35:48,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {7123#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {7123#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {7123#false} assume !(0 == ~tmp___4~0); {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {7123#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {7123#false} ~skip~0 := 0; {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {7123#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); {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {7123#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {7123#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {7123#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {7123#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {7123#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {7123#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {7123#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {7123#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 64: Hoare triple {7123#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 65: Hoare triple {7123#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 66: Hoare triple {7123#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 67: Hoare triple {7123#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 68: Hoare triple {7123#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 69: Hoare triple {7123#false} assume 4432 == #t~mem62;havoc #t~mem62; {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 70: Hoare triple {7123#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 71: Hoare triple {7123#false} assume 5 == ~blastFlag~0; {7123#false} is VALID [2022-04-15 11:35:48,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-15 11:35:48,662 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:35:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:48,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780359188] [2022-04-15 11:35:48,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780359188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:48,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:48,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:48,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:48,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1441181900] [2022-04-15 11:35:48,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1441181900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:48,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:48,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:35:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510972958] [2022-04-15 11:35:48,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:48,664 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:35:48,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:48,664 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:35:48,715 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:35:48,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:35:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:35:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:35:48,716 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:35:50,736 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:35:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:51,715 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-15 11:35:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:35:51,715 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:35:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:51,715 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:35:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:35:51,718 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:35:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:35:51,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:35:52,104 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:35:52,116 INFO L225 Difference]: With dead ends: 668 [2022-04-15 11:35:52,117 INFO L226 Difference]: Without dead ends: 422 [2022-04-15 11:35:52,117 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:35:52,122 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:35:52,123 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:35:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-15 11:35:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-15 11:35:52,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:52,147 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:35:52,148 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:35:52,148 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:35:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:52,160 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:35:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:35:52,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:52,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:52,162 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:35:52,162 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:35:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:52,174 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-15 11:35:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-15 11:35:52,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:52,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:52,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:52,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:52,176 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:35:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-15 11:35:52,182 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-15 11:35:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:52,182 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-15 11:35:52,183 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:35:52,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-15 11:35:52,500 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:35:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-15 11:35:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 11:35:52,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:52,501 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:35:52,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:35:52,501 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:52,502 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-15 11:35:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:52,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211947251] [2022-04-15 11:35:59,789 WARN L232 SmtUtils]: Spent 7.29s 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:36:11,289 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-15 11:36:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:11,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101597331] [2022-04-15 11:36:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:11,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:11,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {9849#(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); {9842#true} is VALID [2022-04-15 11:36:11,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-15 11:36:11,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-15 11:36:11,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {9842#true} call ULTIMATE.init(); {9849#(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:36:11,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {9849#(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); {9842#true} is VALID [2022-04-15 11:36:11,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-15 11:36:11,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-15 11:36:11,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {9842#true} call #t~ret158 := main(); {9842#true} is VALID [2022-04-15 11:36:11,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:11,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {9842#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {9842#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {9842#true} assume 12292 == #t~mem49;havoc #t~mem49; {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {9842#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {9842#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {9842#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:11,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {9842#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {9842#true} assume !(0 == ~tmp___4~0); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {9842#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {9842#true} ~skip~0 := 0; {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {9842#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); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {9842#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {9842#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {9842#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {9842#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {9842#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {9842#true} assume 4368 == #t~mem54;havoc #t~mem54; {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {9842#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; {9842#true} is VALID [2022-04-15 11:36:11,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {9842#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9842#true} is VALID [2022-04-15 11:36:11,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {9842#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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {9847#(= 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; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {9847#(= 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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {9847#(= 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; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {9847#(= 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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {9847#(= 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); {9847#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:11,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {9847#(= 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); {9848#(= |ssl3_connect_#t~mem51| 4384)} is VALID [2022-04-15 11:36:11,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {9848#(= |ssl3_connect_#t~mem51| 4384)} assume 4096 == #t~mem51;havoc #t~mem51; {9843#false} is VALID [2022-04-15 11:36:11,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {9843#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {9843#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9843#false} is VALID [2022-04-15 11:36:11,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {9843#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:11,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {9843#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {9843#false} is VALID [2022-04-15 11:36:11,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {9843#false} assume !(0 == ~tmp___4~0); {9843#false} is VALID [2022-04-15 11:36:11,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:11,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {9843#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {9843#false} ~skip~0 := 0; {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {9843#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); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {9843#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {9843#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {9843#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {9843#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 61: Hoare triple {9843#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {9843#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {9843#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 64: Hoare triple {9843#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {9843#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {9843#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {9843#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {9843#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {9843#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {9843#false} assume 4432 == #t~mem62;havoc #t~mem62; {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 71: Hoare triple {9843#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {9843#false} is VALID [2022-04-15 11:36:11,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {9843#false} assume 5 == ~blastFlag~0; {9843#false} is VALID [2022-04-15 11:36:11,502 INFO L290 TraceCheckUtils]: 73: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-15 11:36:11,502 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:36:11,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:11,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101597331] [2022-04-15 11:36:11,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101597331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:11,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:11,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:11,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:11,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211947251] [2022-04-15 11:36:11,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211947251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:11,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:11,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988283266] [2022-04-15 11:36:11,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:11,503 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:36:11,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:11,504 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:36:11,567 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:36:11,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:11,568 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:36:13,590 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:36:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:14,518 INFO L93 Difference]: Finished difference Result 415 states and 612 transitions. [2022-04-15 11:36:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:14,518 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:36:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:14,518 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:36:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-15 11:36:14,521 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:36:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-15 11:36:14,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 382 transitions. [2022-04-15 11:36:14,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:14,787 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:36:14,787 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:36:14,788 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:36:14,788 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:36:14,788 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:36:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:36:14,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-15 11:36:14,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:14,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 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:36:14,797 INFO L74 IsIncluded]: Start isIncluded. First operand 280 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:36:14,797 INFO L87 Difference]: Start difference. First operand 280 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:36:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:14,801 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:36:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:36:14,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:14,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:14,802 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 280 states. [2022-04-15 11:36:14,802 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 280 states. [2022-04-15 11:36:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:14,806 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-15 11:36:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-15 11:36:14,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:14,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:14,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:14,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:14,807 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:36:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-15 11:36:14,812 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-15 11:36:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:14,812 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-15 11:36:14,812 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:36:14,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-15 11:36:15,084 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:36:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-15 11:36:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 11:36:15,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:15,085 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:36:15,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:36:15,086 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-15 11:36:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:15,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537183707] [2022-04-15 11:36:28,485 WARN L232 SmtUtils]: Spent 9.32s 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:36:35,273 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-15 11:36:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:35,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498879096] [2022-04-15 11:36:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:35,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {11779#(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); {11772#true} is VALID [2022-04-15 11:36:35,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-15 11:36:35,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {11772#true} call ULTIMATE.init(); {11779#(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:36:35,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {11779#(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); {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {11772#true} call #t~ret158 := main(); {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {11772#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:35,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {11772#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {11772#true} assume 12292 == #t~mem49;havoc #t~mem49; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {11772#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {11772#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {11772#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {11772#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {11772#true} assume !(0 == ~tmp___4~0); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {11772#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {11772#true} ~skip~0 := 0; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-15 11:36:35,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {11772#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); {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {11772#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {11772#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {11772#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {11772#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {11772#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {11772#true} assume 4368 == #t~mem54;havoc #t~mem54; {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {11772#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; {11772#true} is VALID [2022-04-15 11:36:35,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {11772#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11772#true} is VALID [2022-04-15 11:36:35,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {11772#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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {11777#(= 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; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {11777#(= 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; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {11777#(= 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); {11777#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {11777#(= 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); {11778#(= |ssl3_connect_#t~mem52| 4384)} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {11778#(= |ssl3_connect_#t~mem52| 4384)} assume 20480 == #t~mem52;havoc #t~mem52; {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {11773#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {11773#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {11773#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {11773#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 51: Hoare triple {11773#false} assume !(0 == ~tmp___4~0); {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 52: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {11773#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11773#false} is VALID [2022-04-15 11:36:35,472 INFO L290 TraceCheckUtils]: 55: Hoare triple {11773#false} ~skip~0 := 0; {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 56: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 57: Hoare triple {11773#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); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {11773#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {11773#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {11773#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {11773#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {11773#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {11773#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {11773#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {11773#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {11773#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 67: Hoare triple {11773#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {11773#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {11773#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {11773#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {11773#false} is VALID [2022-04-15 11:36:35,473 INFO L290 TraceCheckUtils]: 71: Hoare triple {11773#false} assume 4432 == #t~mem62;havoc #t~mem62; {11773#false} is VALID [2022-04-15 11:36:35,474 INFO L290 TraceCheckUtils]: 72: Hoare triple {11773#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11773#false} is VALID [2022-04-15 11:36:35,474 INFO L290 TraceCheckUtils]: 73: Hoare triple {11773#false} assume 5 == ~blastFlag~0; {11773#false} is VALID [2022-04-15 11:36:35,474 INFO L290 TraceCheckUtils]: 74: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-15 11:36:35,474 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:36:35,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:35,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498879096] [2022-04-15 11:36:35,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498879096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:35,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:35,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:35,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:35,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537183707] [2022-04-15 11:36:35,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537183707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:35,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:35,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435438104] [2022-04-15 11:36:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:35,476 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:36:35,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:35,476 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:36:35,531 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:36:35,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:35,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:35,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:35,532 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:36:37,555 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:36:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:38,447 INFO L93 Difference]: Finished difference Result 415 states and 610 transitions. [2022-04-15 11:36:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:36:38,448 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:36:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:36:38,448 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:36:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-15 11:36:38,450 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:36:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-15 11:36:38,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 381 transitions. [2022-04-15 11:36:38,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:36:38,713 INFO L225 Difference]: With dead ends: 415 [2022-04-15 11:36:38,713 INFO L226 Difference]: Without dead ends: 280 [2022-04-15 11:36:38,714 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:36:38,714 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 31 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:36:38,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 478 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 349 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:36:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-15 11:36:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-15 11:36:38,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:36:38,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 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:36:38,723 INFO L74 IsIncluded]: Start isIncluded. First operand 280 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:36:38,724 INFO L87 Difference]: Start difference. First operand 280 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:36:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:38,728 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-15 11:36:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-15 11:36:38,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:38,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:38,729 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 280 states. [2022-04-15 11:36:38,729 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 280 states. [2022-04-15 11:36:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:36:38,733 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-15 11:36:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-15 11:36:38,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:36:38,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:36:38,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:36:38,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:36:38,735 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:36:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-15 11:36:38,739 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-15 11:36:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:36:38,739 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-15 11:36:38,739 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:36:38,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-15 11:36:39,048 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:36:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-15 11:36:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 11:36:39,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:36:39,049 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:36:39,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:36:39,049 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:36:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:36:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-15 11:36:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:39,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685347281] [2022-04-15 11:36:51,316 WARN L232 SmtUtils]: Spent 8.59s 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:36:58,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:36:58,741 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-15 11:36:58,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:36:58,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155600766] [2022-04-15 11:36:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:36:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:36:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:36:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:36:58,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {13709#(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); {13702#true} is VALID [2022-04-15 11:36:58,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-15 11:36:58,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {13702#true} call ULTIMATE.init(); {13709#(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:36:58,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {13709#(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); {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {13702#true} call #t~ret158 := main(); {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {13702#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {13702#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-15 11:36:58,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {13702#true} assume 12292 == #t~mem49;havoc #t~mem49; {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {13702#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {13702#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {13702#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {13702#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {13702#true} assume !(0 == ~tmp___4~0); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {13702#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {13702#true} ~skip~0 := 0; {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {13702#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); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {13702#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {13702#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:36:58,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {13702#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:36:58,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {13702#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:36:58,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {13702#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13702#true} is VALID [2022-04-15 11:36:58,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {13702#true} assume 4368 == #t~mem54;havoc #t~mem54; {13702#true} is VALID [2022-04-15 11:36:58,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {13702#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; {13702#true} is VALID [2022-04-15 11:36:58,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {13702#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13702#true} is VALID [2022-04-15 11:36:58,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {13702#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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {13707#(= 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; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {13707#(= 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; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {13707#(= 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); {13707#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {13707#(= 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); {13708#(= |ssl3_connect_#t~mem53| 4384)} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#(= |ssl3_connect_#t~mem53| 4384)} assume 4099 == #t~mem53;havoc #t~mem53; {13703#false} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {13703#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {13703#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13703#false} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {13703#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {13703#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {13703#false} is VALID [2022-04-15 11:36:58,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {13703#false} assume !(0 == ~tmp___4~0); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {13703#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {13703#false} ~skip~0 := 0; {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {13703#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); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {13703#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {13703#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {13703#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {13703#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {13703#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {13703#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {13703#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {13703#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {13703#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {13703#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {13703#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {13703#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {13703#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13703#false} is VALID [2022-04-15 11:36:58,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {13703#false} assume 4432 == #t~mem62;havoc #t~mem62; {13703#false} is VALID [2022-04-15 11:36:58,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {13703#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {13703#false} is VALID [2022-04-15 11:36:58,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {13703#false} assume 5 == ~blastFlag~0; {13703#false} is VALID [2022-04-15 11:36:58,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-15 11:36:58,906 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:36:58,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:36:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155600766] [2022-04-15 11:36:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155600766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:58,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:36:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [685347281] [2022-04-15 11:36:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [685347281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:36:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:36:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:36:58,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861804207] [2022-04-15 11:36:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:36:58,908 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:36:58,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:36:58,908 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:36:58,971 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:36:58,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:36:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:36:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:36:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:36:58,972 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:37:00,992 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:37:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:01,744 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-04-15 11:37:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:01,744 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:37:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:01,744 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:37:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-15 11:37:01,746 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:37:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-15 11:37:01,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 369 transitions. [2022-04-15 11:37:01,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:01,992 INFO L225 Difference]: With dead ends: 406 [2022-04-15 11:37:01,992 INFO L226 Difference]: Without dead ends: 271 [2022-04-15 11:37:01,993 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:37:01,993 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 22 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:01,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 464 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:37:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-15 11:37:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 264. [2022-04-15 11:37:02,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:02,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 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:37:02,001 INFO L74 IsIncluded]: Start isIncluded. First operand 271 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:37:02,001 INFO L87 Difference]: Start difference. First operand 271 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:37:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:02,005 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-15 11:37:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-15 11:37:02,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:02,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:02,006 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 271 states. [2022-04-15 11:37:02,007 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 271 states. [2022-04-15 11:37:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:02,011 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-15 11:37:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-15 11:37:02,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:02,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:02,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:02,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:02,012 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:37:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-15 11:37:02,026 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-15 11:37:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:02,026 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-15 11:37:02,026 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:37:02,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-15 11:37:02,307 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:37:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-15 11:37:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:37:02,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:02,311 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:37:02,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:37:02,312 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 1 times [2022-04-15 11:37:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:02,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775874284] [2022-04-15 11:37:02,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 2 times [2022-04-15 11:37:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:02,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383712438] [2022-04-15 11:37:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:02,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:02,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {15602#(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); {15596#true} is VALID [2022-04-15 11:37:02,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-15 11:37:02,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {15596#true} call ULTIMATE.init(); {15602#(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:37:02,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {15602#(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); {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {15596#true} call #t~ret158 := main(); {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L272 TraceCheckUtils]: 6: Hoare triple {15596#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:02,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {15596#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {15596#true} assume 12292 == #t~mem49;havoc #t~mem49; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {15596#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {15596#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {15596#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {15596#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {15596#true} assume !(0 == ~tmp___4~0); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {15596#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {15596#true} ~skip~0 := 0; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-15 11:37:02,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {15596#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); {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {15596#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {15596#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {15596#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {15596#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {15596#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {15596#true} assume 4368 == #t~mem54;havoc #t~mem54; {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {15596#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; {15596#true} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {15596#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {15601#(= 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); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {15601#(= 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; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {15601#(= 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); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !false; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {15601#(= 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); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem56;havoc #t~mem56; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-15 11:37:02,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {15597#false} is VALID [2022-04-15 11:37:02,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {15597#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {15597#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {15597#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {15597#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); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {15597#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {15597#false} ~skip~0 := 0; {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {15597#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); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {15597#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {15597#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {15597#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {15597#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {15597#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {15597#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {15597#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {15597#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {15597#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {15597#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {15597#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {15597#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {15597#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {15597#false} assume 4432 == #t~mem62;havoc #t~mem62; {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {15597#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {15597#false} assume 5 == ~blastFlag~0; {15597#false} is VALID [2022-04-15 11:37:02,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-15 11:37:02,456 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:37:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:02,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383712438] [2022-04-15 11:37:02,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383712438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:02,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:02,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:02,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:02,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775874284] [2022-04-15 11:37:02,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775874284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:02,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:02,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363130456] [2022-04-15 11:37:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:02,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 11:37:02,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:02,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:02,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:02,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:37:02,514 INFO L87 Difference]: Start difference. First operand 264 states and 385 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:04,530 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:37:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:05,053 INFO L93 Difference]: Finished difference Result 423 states and 619 transitions. [2022-04-15 11:37:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:05,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 11:37:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:37:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-15 11:37:05,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-15 11:37:05,300 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:37:05,304 INFO L225 Difference]: With dead ends: 423 [2022-04-15 11:37:05,304 INFO L226 Difference]: Without dead ends: 288 [2022-04-15 11:37:05,304 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:37:05,305 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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:37:05,305 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:37:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-15 11:37:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-04-15 11:37:05,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:05,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 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:37:05,314 INFO L74 IsIncluded]: Start isIncluded. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 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:37:05,314 INFO L87 Difference]: Start difference. First operand 288 states. Second operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 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:37:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:05,318 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-15 11:37:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-15 11:37:05,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:05,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:05,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 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 288 states. [2022-04-15 11:37:05,319 INFO L87 Difference]: Start difference. First operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 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 288 states. [2022-04-15 11:37:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:05,323 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-15 11:37:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-15 11:37:05,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:05,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:05,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:05,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 283 states have (on average 1.459363957597173) internal successors, (413), 283 states have internal predecessors, (413), 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:37:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2022-04-15 11:37:05,329 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 77 [2022-04-15 11:37:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:05,329 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-04-15 11:37:05,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:05,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 417 transitions. [2022-04-15 11:37:05,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-15 11:37:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:37:05,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:05,668 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:37:05,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:37:05,668 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 1 times [2022-04-15 11:37:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:05,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221689480] [2022-04-15 11:37:05,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 2 times [2022-04-15 11:37:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:05,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253391767] [2022-04-15 11:37:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:05,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {17609#(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); {17603#true} is VALID [2022-04-15 11:37:05,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-15 11:37:05,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {17603#true} call ULTIMATE.init(); {17609#(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:37:05,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {17609#(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); {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {17603#true} call #t~ret158 := main(); {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {17603#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {17603#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {17603#true} assume 12292 == #t~mem49;havoc #t~mem49; {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {17603#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {17603#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {17603#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {17603#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {17603#true} assume !(0 == ~tmp___4~0); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {17603#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {17603#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {17603#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {17603#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {17603#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {17603#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {17603#true} assume 4368 == #t~mem54;havoc #t~mem54; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {17603#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {17603#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; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {17603#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17603#true} is VALID [2022-04-15 11:37:05,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {17603#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); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {17603#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {17603#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {17603#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {17603#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {17603#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {17603#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {17603#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {17603#true} assume 4384 == #t~mem56;havoc #t~mem56; {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {17603#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {17603#true} is VALID [2022-04-15 11:37:05,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {17603#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {17608#(= 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); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,826 INFO L290 TraceCheckUtils]: 58: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,826 INFO L290 TraceCheckUtils]: 59: Hoare triple {17608#(= 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); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,828 INFO L290 TraceCheckUtils]: 64: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,828 INFO L290 TraceCheckUtils]: 67: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,830 INFO L290 TraceCheckUtils]: 71: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,830 INFO L290 TraceCheckUtils]: 72: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:05,831 INFO L290 TraceCheckUtils]: 75: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {17604#false} is VALID [2022-04-15 11:37:05,831 INFO L290 TraceCheckUtils]: 76: Hoare triple {17604#false} assume !false; {17604#false} is VALID [2022-04-15 11:37:05,831 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:37:05,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253391767] [2022-04-15 11:37:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253391767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:05,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:05,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:05,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:05,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221689480] [2022-04-15 11:37:05,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221689480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:05,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:05,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789285599] [2022-04-15 11:37:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:05,832 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:37:05,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:05,833 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:37:05,886 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:37:05,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:05,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:37:05,887 INFO L87 Difference]: Start difference. First operand 288 states and 417 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:37:07,904 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:37:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:08,761 INFO L93 Difference]: Finished difference Result 578 states and 845 transitions. [2022-04-15 11:37:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:08,761 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:37:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:08,762 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:37:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:37:08,764 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:37:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-15 11:37:08,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-15 11:37:09,081 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:37:09,089 INFO L225 Difference]: With dead ends: 578 [2022-04-15 11:37:09,089 INFO L226 Difference]: Without dead ends: 419 [2022-04-15 11:37:09,089 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:37:09,090 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 125 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:09,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 477 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:37:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-15 11:37:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2022-04-15 11:37:09,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:09,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 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:37:09,102 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 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:37:09,103 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 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:37:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:09,129 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-15 11:37:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-15 11:37:09,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:09,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:09,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 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 419 states. [2022-04-15 11:37:09,131 INFO L87 Difference]: Start difference. First operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 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 419 states. [2022-04-15 11:37:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:09,139 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-15 11:37:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-15 11:37:09,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:09,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:09,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:09,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.458937198067633) internal successors, (604), 414 states have internal predecessors, (604), 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:37:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 608 transitions. [2022-04-15 11:37:09,148 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 608 transitions. Word has length 77 [2022-04-15 11:37:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:09,148 INFO L478 AbstractCegarLoop]: Abstraction has 419 states and 608 transitions. [2022-04-15 11:37:09,149 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:37:09,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 419 states and 608 transitions. [2022-04-15 11:37:09,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-15 11:37:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 11:37:09,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:09,568 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:37:09,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:37:09,568 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 1 times [2022-04-15 11:37:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:09,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318772636] [2022-04-15 11:37:09,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 2 times [2022-04-15 11:37:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:09,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682317369] [2022-04-15 11:37:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:09,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {20450#(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); {20444#true} is VALID [2022-04-15 11:37:09,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-15 11:37:09,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-15 11:37:09,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {20444#true} call ULTIMATE.init(); {20450#(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:37:09,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {20450#(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); {20444#true} is VALID [2022-04-15 11:37:09,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-15 11:37:09,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {20444#true} call #t~ret158 := main(); {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {20444#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {20444#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {20444#true} assume 12292 == #t~mem49;havoc #t~mem49; {20444#true} is VALID [2022-04-15 11:37:09,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:09,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {20444#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {20444#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20444#true} is VALID [2022-04-15 11:37:09,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {20444#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {20444#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {20444#true} is VALID [2022-04-15 11:37:09,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {20444#true} assume !(0 == ~tmp___4~0); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {20444#true} assume 4368 == #t~mem54;havoc #t~mem54; {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {20444#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:09,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 46: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {20444#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {20444#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {20444#true} assume 4384 == #t~mem56;havoc #t~mem56; {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {20444#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {20444#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {20444#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {20444#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {20444#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {20444#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {20444#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {20444#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {20444#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 63: Hoare triple {20444#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 64: Hoare triple {20444#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {20444#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 66: Hoare triple {20444#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 67: Hoare triple {20444#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 68: Hoare triple {20444#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 69: Hoare triple {20444#true} assume 4400 == #t~mem58;havoc #t~mem58; {20444#true} is VALID [2022-04-15 11:37:09,738 INFO L290 TraceCheckUtils]: 70: Hoare triple {20444#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); {20444#true} is VALID [2022-04-15 11:37:09,739 INFO L290 TraceCheckUtils]: 71: Hoare triple {20444#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; {20444#true} is VALID [2022-04-15 11:37:09,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {20444#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {20449#(= 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); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {20449#(= 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); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {20449#(= 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); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,750 INFO L290 TraceCheckUtils]: 80: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,751 INFO L290 TraceCheckUtils]: 82: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,751 INFO L290 TraceCheckUtils]: 83: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,751 INFO L290 TraceCheckUtils]: 84: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,752 INFO L290 TraceCheckUtils]: 85: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,753 INFO L290 TraceCheckUtils]: 90: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,753 INFO L290 TraceCheckUtils]: 91: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,753 INFO L290 TraceCheckUtils]: 92: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,753 INFO L290 TraceCheckUtils]: 93: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem62;havoc #t~mem62; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-15 11:37:09,754 INFO L290 TraceCheckUtils]: 95: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {20445#false} is VALID [2022-04-15 11:37:09,754 INFO L290 TraceCheckUtils]: 96: Hoare triple {20445#false} assume !false; {20445#false} is VALID [2022-04-15 11:37:09,754 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:37:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:09,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682317369] [2022-04-15 11:37:09,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682317369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:09,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:09,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:09,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:09,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318772636] [2022-04-15 11:37:09,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318772636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:09,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:09,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630711168] [2022-04-15 11:37:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:09,755 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:37:09,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:09,756 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:37:09,802 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:37:09,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:09,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:37:09,803 INFO L87 Difference]: Start difference. First operand 419 states and 608 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:37:11,820 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:37:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:12,696 INFO L93 Difference]: Finished difference Result 840 states and 1228 transitions. [2022-04-15 11:37:12,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:12,696 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:37:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:12,696 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:37:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:37:12,699 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:37:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-15 11:37:12,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-15 11:37:12,996 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:37:13,008 INFO L225 Difference]: With dead ends: 840 [2022-04-15 11:37:13,009 INFO L226 Difference]: Without dead ends: 550 [2022-04-15 11:37:13,009 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:37:13,010 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:37:13,010 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:37:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-04-15 11:37:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-04-15 11:37:13,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:13,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 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:37:13,023 INFO L74 IsIncluded]: Start isIncluded. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 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:37:13,024 INFO L87 Difference]: Start difference. First operand 550 states. Second operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 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:37:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:13,034 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-15 11:37:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-15 11:37:13,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:13,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:13,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 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 550 states. [2022-04-15 11:37:13,036 INFO L87 Difference]: Start difference. First operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 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 550 states. [2022-04-15 11:37:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:13,047 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-15 11:37:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-15 11:37:13,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:13,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:13,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:13,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4587155963302751) internal successors, (795), 545 states have internal predecessors, (795), 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:37:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 799 transitions. [2022-04-15 11:37:13,061 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 799 transitions. Word has length 97 [2022-04-15 11:37:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:13,062 INFO L478 AbstractCegarLoop]: Abstraction has 550 states and 799 transitions. [2022-04-15 11:37:13,062 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:37:13,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 550 states and 799 transitions. [2022-04-15 11:37:13,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 799 edges. 799 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-15 11:37:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:37:13,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:13,636 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:37:13,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:37:13,636 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-15 11:37:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:13,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389702458] [2022-04-15 11:37:13,637 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-15 11:37:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:13,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200547512] [2022-04-15 11:37:13,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:13,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {24339#(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); {24333#true} is VALID [2022-04-15 11:37:13,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-15 11:37:13,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-15 11:37:13,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {24333#true} call ULTIMATE.init(); {24339#(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:37:13,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {24339#(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); {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {24333#true} call #t~ret158 := main(); {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {24333#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {24333#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {24333#true} assume 12292 == #t~mem49;havoc #t~mem49; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {24333#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {24333#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24333#true} is VALID [2022-04-15 11:37:13,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {24333#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {24333#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {24333#true} is VALID [2022-04-15 11:37:13,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {24333#true} assume !(0 == ~tmp___4~0); {24333#true} is VALID [2022-04-15 11:37:13,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {24333#true} assume 4368 == #t~mem54;havoc #t~mem54; {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {24333#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:13,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {24333#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {24333#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {24333#true} assume 4384 == #t~mem56;havoc #t~mem56; {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {24333#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {24333#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {24333#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {24333#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {24333#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {24333#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 66: Hoare triple {24333#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {24333#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {24333#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {24333#true} assume 4400 == #t~mem58;havoc #t~mem58; {24333#true} is VALID [2022-04-15 11:37:13,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {24333#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; {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {24333#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {24333#true} assume !(~ret~0 <= 0); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {24333#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {24333#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 79: Hoare triple {24333#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); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {24333#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {24333#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {24333#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {24333#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 84: Hoare triple {24333#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {24333#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,787 INFO L290 TraceCheckUtils]: 86: Hoare triple {24333#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {24333#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {24333#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {24333#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 90: Hoare triple {24333#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24333#true} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 91: Hoare triple {24333#true} assume 4416 == #t~mem60;havoc #t~mem60; {24333#true} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 92: Hoare triple {24333#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {24333#true} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {24333#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,788 INFO L290 TraceCheckUtils]: 94: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,789 INFO L290 TraceCheckUtils]: 95: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} 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); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !false; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} 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); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,790 INFO L290 TraceCheckUtils]: 101: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,790 INFO L290 TraceCheckUtils]: 102: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,791 INFO L290 TraceCheckUtils]: 103: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,792 INFO L290 TraceCheckUtils]: 106: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,792 INFO L290 TraceCheckUtils]: 107: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,792 INFO L290 TraceCheckUtils]: 109: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,793 INFO L290 TraceCheckUtils]: 110: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,793 INFO L290 TraceCheckUtils]: 111: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,793 INFO L290 TraceCheckUtils]: 112: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,793 INFO L290 TraceCheckUtils]: 113: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,794 INFO L290 TraceCheckUtils]: 114: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem62;havoc #t~mem62; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,794 INFO L290 TraceCheckUtils]: 115: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-15 11:37:13,794 INFO L290 TraceCheckUtils]: 116: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {24334#false} is VALID [2022-04-15 11:37:13,794 INFO L290 TraceCheckUtils]: 117: Hoare triple {24334#false} assume !false; {24334#false} is VALID [2022-04-15 11:37:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 11:37:13,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:13,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200547512] [2022-04-15 11:37:13,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200547512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:13,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:13,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:13,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:13,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389702458] [2022-04-15 11:37:13,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389702458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:13,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:13,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:37:13,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128104877] [2022-04-15 11:37:13,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:13,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:37:13,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:13,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 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:37:13,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:13,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:37:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:13,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:37:13,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:37:13,866 INFO L87 Difference]: Start difference. First operand 550 states and 799 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 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:37:15,881 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:37:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:16,761 INFO L93 Difference]: Finished difference Result 1103 states and 1611 transitions. [2022-04-15 11:37:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:37:16,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:37:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 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:37:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:37:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 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:37:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-15 11:37:16,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-15 11:37:17,053 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:37:17,070 INFO L225 Difference]: With dead ends: 1103 [2022-04-15 11:37:17,070 INFO L226 Difference]: Without dead ends: 682 [2022-04-15 11:37:17,070 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:37:17,071 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 127 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 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:37:17,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 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:37:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-15 11:37:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2022-04-15 11:37:17,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:17,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 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:37:17,086 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 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:37:17,087 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 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:37:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:17,100 INFO L93 Difference]: Finished difference Result 682 states and 991 transitions. [2022-04-15 11:37:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-15 11:37:17,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:17,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:17,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 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 682 states. [2022-04-15 11:37:17,103 INFO L87 Difference]: Start difference. First operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 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 682 states. [2022-04-15 11:37:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:17,117 INFO L93 Difference]: Finished difference Result 682 states and 991 transitions. [2022-04-15 11:37:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-15 11:37:17,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:17,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:17,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:17,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 677 states have (on average 1.4579025110782866) internal successors, (987), 677 states have internal predecessors, (987), 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:37:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 991 transitions. [2022-04-15 11:37:17,144 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 991 transitions. Word has length 118 [2022-04-15 11:37:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:17,144 INFO L478 AbstractCegarLoop]: Abstraction has 682 states and 991 transitions. [2022-04-15 11:37:17,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 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:37:17,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 682 states and 991 transitions. [2022-04-15 11:37:17,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-15 11:37:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-15 11:37:17,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:17,815 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:17,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:37:17,815 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:17,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1826850427, now seen corresponding path program 1 times [2022-04-15 11:37:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:17,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100743087] [2022-04-15 11:37:30,165 WARN L232 SmtUtils]: Spent 9.05s 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:37:39,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:37:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1826850427, now seen corresponding path program 2 times [2022-04-15 11:37:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:37:39,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731769098] [2022-04-15 11:37:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:37:39,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:37:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:37:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:37:39,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {29283#(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); {29276#true} is VALID [2022-04-15 11:37:39,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {29276#true} assume true; {29276#true} is VALID [2022-04-15 11:37:39,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29276#true} {29276#true} #593#return; {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {29276#true} call ULTIMATE.init(); {29283#(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:37:39,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {29283#(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); {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {29276#true} assume true; {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29276#true} {29276#true} #593#return; {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {29276#true} call #t~ret158 := main(); {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {29276#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; {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L272 TraceCheckUtils]: 6: Hoare triple {29276#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {29276#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; {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {29276#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; {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {29276#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-15 11:37:39,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {29276#true} assume 12292 == #t~mem49;havoc #t~mem49; {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {29276#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; {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {29276#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {29276#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {29276#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {29276#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {29276#true} assume !(0 == ~tmp___4~0); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {29276#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {29276#true} ~skip~0 := 0; {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {29276#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {29276#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {29276#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {29276#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {29276#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {29276#true} assume 4368 == #t~mem54;havoc #t~mem54; {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {29276#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; {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {29276#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {29276#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; {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {29276#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {29276#true} ~skip~0 := 0; {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {29276#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); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {29276#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {29276#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {29276#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {29276#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {29276#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {29276#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {29276#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {29276#true} assume 4384 == #t~mem56;havoc #t~mem56; {29276#true} is VALID [2022-04-15 11:37:39,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {29276#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {29276#true} is VALID [2022-04-15 11:37:39,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {29276#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29276#true} is VALID [2022-04-15 11:37:39,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {29276#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {29276#true} is VALID [2022-04-15 11:37:39,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {29276#true} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {29281#(not (= 4400 (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; {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,325 INFO L290 TraceCheckUtils]: 59: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,326 INFO L290 TraceCheckUtils]: 63: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,327 INFO L290 TraceCheckUtils]: 64: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,327 INFO L290 TraceCheckUtils]: 65: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {29281#(not (= 4400 (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); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {29281#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29282#(not (= |ssl3_connect_#t~mem58| 4400))} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {29282#(not (= |ssl3_connect_#t~mem58| 4400))} assume 4400 == #t~mem58;havoc #t~mem58; {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {29277#false} 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); {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 71: Hoare triple {29277#false} 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; {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 72: Hoare triple {29277#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 73: Hoare triple {29277#false} assume !(~ret~0 <= 0); {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 74: Hoare triple {29277#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 75: Hoare triple {29277#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); {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 76: Hoare triple {29277#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 77: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 78: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-15 11:37:39,328 INFO L290 TraceCheckUtils]: 79: Hoare triple {29277#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); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 80: Hoare triple {29277#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 81: Hoare triple {29277#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 82: Hoare triple {29277#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 83: Hoare triple {29277#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 84: Hoare triple {29277#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 85: Hoare triple {29277#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 86: Hoare triple {29277#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 87: Hoare triple {29277#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {29277#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 89: Hoare triple {29277#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 90: Hoare triple {29277#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 91: Hoare triple {29277#false} assume 4416 == #t~mem60;havoc #t~mem60; {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 92: Hoare triple {29277#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 93: Hoare triple {29277#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 94: Hoare triple {29277#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 95: Hoare triple {29277#false} assume !(0 == ~tmp___6~0); {29277#false} is VALID [2022-04-15 11:37:39,329 INFO L290 TraceCheckUtils]: 96: Hoare triple {29277#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); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {29277#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 98: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 99: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 100: Hoare triple {29277#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); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 101: Hoare triple {29277#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 102: Hoare triple {29277#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 103: Hoare triple {29277#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 104: Hoare triple {29277#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 105: Hoare triple {29277#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 106: Hoare triple {29277#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 107: Hoare triple {29277#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 108: Hoare triple {29277#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 109: Hoare triple {29277#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 110: Hoare triple {29277#false} assume 4400 == #t~mem58;havoc #t~mem58; {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 111: Hoare triple {29277#false} 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); {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 112: Hoare triple {29277#false} 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; {29277#false} is VALID [2022-04-15 11:37:39,330 INFO L290 TraceCheckUtils]: 113: Hoare triple {29277#false} assume !(2 == ~blastFlag~0); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 114: Hoare triple {29277#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 115: Hoare triple {29277#false} assume !(~ret~0 <= 0); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 116: Hoare triple {29277#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 117: Hoare triple {29277#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); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 118: Hoare triple {29277#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 119: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 120: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 121: Hoare triple {29277#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); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 122: Hoare triple {29277#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 123: Hoare triple {29277#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 124: Hoare triple {29277#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 125: Hoare triple {29277#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 126: Hoare triple {29277#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 127: Hoare triple {29277#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 128: Hoare triple {29277#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 129: Hoare triple {29277#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,331 INFO L290 TraceCheckUtils]: 130: Hoare triple {29277#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 131: Hoare triple {29277#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 132: Hoare triple {29277#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 133: Hoare triple {29277#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 134: Hoare triple {29277#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 135: Hoare triple {29277#false} assume 4432 == #t~mem62;havoc #t~mem62; {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 136: Hoare triple {29277#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 137: Hoare triple {29277#false} assume 5 == ~blastFlag~0; {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L290 TraceCheckUtils]: 138: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-15 11:37:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-15 11:37:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:37:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731769098] [2022-04-15 11:37:39,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731769098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:39,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:39,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:39,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:37:39,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100743087] [2022-04-15 11:37:39,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100743087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:37:39,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:37:39,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:37:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754388328] [2022-04-15 11:37:39,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:37:39,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 11:37:39,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:37:39,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:39,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:39,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:37:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:37:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:37:39,401 INFO L87 Difference]: Start difference. First operand 682 states and 991 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:41,420 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:37:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:42,474 INFO L93 Difference]: Finished difference Result 1802 states and 2631 transitions. [2022-04-15 11:37:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:37:42,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-04-15 11:37:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:37:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:37:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:37:42,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:37:42,777 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:37:42,831 INFO L225 Difference]: With dead ends: 1802 [2022-04-15 11:37:42,832 INFO L226 Difference]: Without dead ends: 1136 [2022-04-15 11:37:42,833 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:37:42,833 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 111 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:37:42,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 280 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:37:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-04-15 11:37:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 787. [2022-04-15 11:37:42,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:37:42,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1136 states. Second operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 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:37:42,858 INFO L74 IsIncluded]: Start isIncluded. First operand 1136 states. Second operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 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:37:42,859 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 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:37:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:42,895 INFO L93 Difference]: Finished difference Result 1136 states and 1655 transitions. [2022-04-15 11:37:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1655 transitions. [2022-04-15 11:37:42,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:42,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:42,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 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 1136 states. [2022-04-15 11:37:42,898 INFO L87 Difference]: Start difference. First operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 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 1136 states. [2022-04-15 11:37:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:37:42,934 INFO L93 Difference]: Finished difference Result 1136 states and 1655 transitions. [2022-04-15 11:37:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1655 transitions. [2022-04-15 11:37:42,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:37:42,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:37:42,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:37:42,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:37:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 782 states have (on average 1.473145780051151) internal successors, (1152), 782 states have internal predecessors, (1152), 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:37:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1156 transitions. [2022-04-15 11:37:42,966 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1156 transitions. Word has length 139 [2022-04-15 11:37:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:37:42,966 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 1156 transitions. [2022-04-15 11:37:42,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:37:42,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 787 states and 1156 transitions. [2022-04-15 11:37:43,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1156 edges. 1156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:37:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1156 transitions. [2022-04-15 11:37:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-15 11:37:43,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:37:43,836 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:37:43,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:37:43,836 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:37:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:37:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1784272250, now seen corresponding path program 1 times [2022-04-15 11:37:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:37:43,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011122431] [2022-04-15 11:37:55,681 WARN L232 SmtUtils]: Spent 8.72s 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:38:03,723 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1784272250, now seen corresponding path program 2 times [2022-04-15 11:38:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:03,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114253255] [2022-04-15 11:38:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:03,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:03,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {36745#(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); {36738#true} is VALID [2022-04-15 11:38:03,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {36738#true} assume true; {36738#true} is VALID [2022-04-15 11:38:03,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36738#true} {36738#true} #593#return; {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {36738#true} call ULTIMATE.init(); {36745#(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:38:03,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {36745#(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); {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {36738#true} assume true; {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36738#true} {36738#true} #593#return; {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {36738#true} call #t~ret158 := main(); {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {36738#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; {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {36738#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {36738#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; {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {36738#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; {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {36738#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {36738#true} assume 12292 == #t~mem49;havoc #t~mem49; {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {36738#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; {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {36738#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {36738#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {36738#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {36738#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {36738#true} assume !(0 == ~tmp___4~0); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {36738#true} assume 4368 == #t~mem54;havoc #t~mem54; {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {36738#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; {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {36738#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {36738#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; {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {36738#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {36738#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {36738#true} assume 4384 == #t~mem56;havoc #t~mem56; {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {36738#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {36738#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {36738#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {36738#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {36738#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 55: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 58: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 62: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,886 INFO L290 TraceCheckUtils]: 63: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {36738#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 66: Hoare triple {36738#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 67: Hoare triple {36738#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 68: Hoare triple {36738#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 69: Hoare triple {36738#true} assume 4400 == #t~mem58;havoc #t~mem58; {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {36738#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; {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 72: Hoare triple {36738#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 73: Hoare triple {36738#true} assume !(~ret~0 <= 0); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 74: Hoare triple {36738#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 75: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {36738#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 78: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 79: Hoare triple {36738#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); {36738#true} is VALID [2022-04-15 11:38:03,887 INFO L290 TraceCheckUtils]: 80: Hoare triple {36738#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 81: Hoare triple {36738#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 82: Hoare triple {36738#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 83: Hoare triple {36738#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 84: Hoare triple {36738#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {36738#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 86: Hoare triple {36738#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {36738#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {36738#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {36738#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 90: Hoare triple {36738#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 91: Hoare triple {36738#true} assume 4416 == #t~mem60;havoc #t~mem60; {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {36738#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {36738#true} is VALID [2022-04-15 11:38:03,888 INFO L290 TraceCheckUtils]: 93: Hoare triple {36738#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {36738#true} is VALID [2022-04-15 11:38:03,889 INFO L290 TraceCheckUtils]: 94: Hoare triple {36738#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,890 INFO L290 TraceCheckUtils]: 96: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {36743#(= 4432 (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; {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,890 INFO L290 TraceCheckUtils]: 98: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,890 INFO L290 TraceCheckUtils]: 99: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,891 INFO L290 TraceCheckUtils]: 100: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,891 INFO L290 TraceCheckUtils]: 101: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,891 INFO L290 TraceCheckUtils]: 102: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,891 INFO L290 TraceCheckUtils]: 103: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,892 INFO L290 TraceCheckUtils]: 104: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,892 INFO L290 TraceCheckUtils]: 105: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,892 INFO L290 TraceCheckUtils]: 106: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,892 INFO L290 TraceCheckUtils]: 107: Hoare triple {36743#(= 4432 (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); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,893 INFO L290 TraceCheckUtils]: 108: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,893 INFO L290 TraceCheckUtils]: 109: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:03,893 INFO L290 TraceCheckUtils]: 110: Hoare triple {36743#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36744#(= |ssl3_connect_#t~mem59| 4432)} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 111: Hoare triple {36744#(= |ssl3_connect_#t~mem59| 4432)} assume 4401 == #t~mem59;havoc #t~mem59; {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 112: Hoare triple {36739#false} 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); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 113: Hoare triple {36739#false} 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; {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 114: Hoare triple {36739#false} assume !(2 == ~blastFlag~0); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 115: Hoare triple {36739#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {36739#false} assume !(~ret~0 <= 0); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {36739#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 118: Hoare triple {36739#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); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 119: Hoare triple {36739#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 120: Hoare triple {36739#false} ~skip~0 := 0; {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 121: Hoare triple {36739#false} assume !false; {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 122: Hoare triple {36739#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); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 123: Hoare triple {36739#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 124: Hoare triple {36739#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 125: Hoare triple {36739#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,894 INFO L290 TraceCheckUtils]: 126: Hoare triple {36739#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 127: Hoare triple {36739#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 128: Hoare triple {36739#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 129: Hoare triple {36739#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 130: Hoare triple {36739#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 131: Hoare triple {36739#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 132: Hoare triple {36739#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 133: Hoare triple {36739#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 134: Hoare triple {36739#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 135: Hoare triple {36739#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 136: Hoare triple {36739#false} assume 4432 == #t~mem62;havoc #t~mem62; {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 137: Hoare triple {36739#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 138: Hoare triple {36739#false} assume 5 == ~blastFlag~0; {36739#false} is VALID [2022-04-15 11:38:03,895 INFO L290 TraceCheckUtils]: 139: Hoare triple {36739#false} assume !false; {36739#false} is VALID [2022-04-15 11:38:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-15 11:38:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114253255] [2022-04-15 11:38:03,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114253255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:03,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:03,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:03,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:03,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011122431] [2022-04-15 11:38:03,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011122431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:03,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:03,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35582733] [2022-04-15 11:38:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:03,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 140 [2022-04-15 11:38:03,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:03,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:03,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:03,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:03,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:03,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:03,968 INFO L87 Difference]: Start difference. First operand 787 states and 1156 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:05,995 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:38:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:07,360 INFO L93 Difference]: Finished difference Result 1896 states and 2793 transitions. [2022-04-15 11:38:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:07,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 140 [2022-04-15 11:38:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-15 11:38:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-15 11:38:07,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-15 11:38:07,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:07,696 INFO L225 Difference]: With dead ends: 1896 [2022-04-15 11:38:07,696 INFO L226 Difference]: Without dead ends: 1125 [2022-04-15 11:38:07,697 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:38:07,697 INFO L913 BasicCegarLoop]: 236 mSDtfsCounter, 89 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:07,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 561 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-04-15 11:38:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 871. [2022-04-15 11:38:07,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:07,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 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:38:07,733 INFO L74 IsIncluded]: Start isIncluded. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 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:38:07,734 INFO L87 Difference]: Start difference. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 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:38:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:07,769 INFO L93 Difference]: Finished difference Result 1125 states and 1653 transitions. [2022-04-15 11:38:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1653 transitions. [2022-04-15 11:38:07,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:07,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:07,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 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 1125 states. [2022-04-15 11:38:07,772 INFO L87 Difference]: Start difference. First operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 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 1125 states. [2022-04-15 11:38:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:07,809 INFO L93 Difference]: Finished difference Result 1125 states and 1653 transitions. [2022-04-15 11:38:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1653 transitions. [2022-04-15 11:38:07,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:07,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:07,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:07,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.4826789838337182) internal successors, (1284), 866 states have internal predecessors, (1284), 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:38:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1288 transitions. [2022-04-15 11:38:07,844 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1288 transitions. Word has length 140 [2022-04-15 11:38:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:07,844 INFO L478 AbstractCegarLoop]: Abstraction has 871 states and 1288 transitions. [2022-04-15 11:38:07,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:07,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1288 transitions. [2022-04-15 11:38:08,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1288 edges. 1288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1288 transitions. [2022-04-15 11:38:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 11:38:08,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:08,822 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:08,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:38:08,823 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1065118499, now seen corresponding path program 1 times [2022-04-15 11:38:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:08,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809492816] [2022-04-15 11:38:18,300 WARN L232 SmtUtils]: Spent 9.03s 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:38:31,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1065118499, now seen corresponding path program 2 times [2022-04-15 11:38:31,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:31,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982501433] [2022-04-15 11:38:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:31,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:31,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {44541#(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); {44534#true} is VALID [2022-04-15 11:38:31,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {44534#true} assume true; {44534#true} is VALID [2022-04-15 11:38:31,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44534#true} {44534#true} #593#return; {44534#true} is VALID [2022-04-15 11:38:31,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {44534#true} call ULTIMATE.init(); {44541#(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:38:31,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {44541#(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); {44534#true} is VALID [2022-04-15 11:38:31,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {44534#true} assume true; {44534#true} is VALID [2022-04-15 11:38:31,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44534#true} {44534#true} #593#return; {44534#true} is VALID [2022-04-15 11:38:31,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {44534#true} call #t~ret158 := main(); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {44534#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; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {44534#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {44534#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; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {44534#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; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {44534#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {44534#true} assume 12292 == #t~mem49;havoc #t~mem49; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {44534#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; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {44534#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {44534#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {44534#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {44534#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {44534#true} assume !(0 == ~tmp___4~0); {44534#true} is VALID [2022-04-15 11:38:31,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {44534#true} assume 4368 == #t~mem54;havoc #t~mem54; {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {44534#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; {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {44534#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {44534#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; {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {44534#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {44534#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {44534#true} assume 4384 == #t~mem56;havoc #t~mem56; {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {44534#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {44534#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {44534#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {44534#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {44534#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 64: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {44534#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {44534#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {44534#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 68: Hoare triple {44534#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 69: Hoare triple {44534#true} assume 4400 == #t~mem58;havoc #t~mem58; {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 71: Hoare triple {44534#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; {44534#true} is VALID [2022-04-15 11:38:31,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {44534#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {44534#true} assume !(~ret~0 <= 0); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {44534#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {44534#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 77: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 78: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 79: Hoare triple {44534#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); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 80: Hoare triple {44534#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 81: Hoare triple {44534#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 82: Hoare triple {44534#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {44534#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {44534#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 85: Hoare triple {44534#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 86: Hoare triple {44534#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 87: Hoare triple {44534#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 88: Hoare triple {44534#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,230 INFO L290 TraceCheckUtils]: 89: Hoare triple {44534#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,231 INFO L290 TraceCheckUtils]: 90: Hoare triple {44534#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44534#true} is VALID [2022-04-15 11:38:31,231 INFO L290 TraceCheckUtils]: 91: Hoare triple {44534#true} assume 4416 == #t~mem60;havoc #t~mem60; {44534#true} is VALID [2022-04-15 11:38:31,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {44534#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {44534#true} is VALID [2022-04-15 11:38:31,231 INFO L290 TraceCheckUtils]: 93: Hoare triple {44534#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44534#true} is VALID [2022-04-15 11:38:31,232 INFO L290 TraceCheckUtils]: 94: Hoare triple {44534#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,232 INFO L290 TraceCheckUtils]: 95: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,232 INFO L290 TraceCheckUtils]: 96: Hoare triple {44539#(= 4432 (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); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,232 INFO L290 TraceCheckUtils]: 97: Hoare triple {44539#(= 4432 (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; {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,233 INFO L290 TraceCheckUtils]: 98: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,233 INFO L290 TraceCheckUtils]: 99: Hoare triple {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,233 INFO L290 TraceCheckUtils]: 100: Hoare triple {44539#(= 4432 (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); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,233 INFO L290 TraceCheckUtils]: 101: Hoare triple {44539#(= 4432 (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); {44539#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 102: Hoare triple {44539#(= 4432 (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); {44540#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 103: Hoare triple {44540#(= |ssl3_connect_#t~mem51| 4432)} assume 4096 == #t~mem51;havoc #t~mem51; {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 104: Hoare triple {44535#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 105: Hoare triple {44535#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 106: Hoare triple {44535#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 107: Hoare triple {44535#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); {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 108: Hoare triple {44535#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 109: Hoare triple {44535#false} assume !(0 == ~tmp___4~0); {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 110: Hoare triple {44535#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); {44535#false} is VALID [2022-04-15 11:38:31,234 INFO L290 TraceCheckUtils]: 111: Hoare triple {44535#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); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 112: Hoare triple {44535#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 113: Hoare triple {44535#false} ~skip~0 := 0; {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 114: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 115: Hoare triple {44535#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); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 116: Hoare triple {44535#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 117: Hoare triple {44535#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 118: Hoare triple {44535#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 119: Hoare triple {44535#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 120: Hoare triple {44535#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 121: Hoare triple {44535#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 122: Hoare triple {44535#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 123: Hoare triple {44535#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 124: Hoare triple {44535#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 125: Hoare triple {44535#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 126: Hoare triple {44535#false} assume 4401 == #t~mem59;havoc #t~mem59; {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 127: Hoare triple {44535#false} 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); {44535#false} is VALID [2022-04-15 11:38:31,235 INFO L290 TraceCheckUtils]: 128: Hoare triple {44535#false} 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; {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 129: Hoare triple {44535#false} assume !(2 == ~blastFlag~0); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 130: Hoare triple {44535#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 131: Hoare triple {44535#false} assume !(~ret~0 <= 0); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 132: Hoare triple {44535#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 133: Hoare triple {44535#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); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 134: Hoare triple {44535#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 135: Hoare triple {44535#false} ~skip~0 := 0; {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 136: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 137: Hoare triple {44535#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); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 138: Hoare triple {44535#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 139: Hoare triple {44535#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 140: Hoare triple {44535#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 141: Hoare triple {44535#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 142: Hoare triple {44535#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 143: Hoare triple {44535#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 144: Hoare triple {44535#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 145: Hoare triple {44535#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,236 INFO L290 TraceCheckUtils]: 146: Hoare triple {44535#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 147: Hoare triple {44535#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 148: Hoare triple {44535#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 149: Hoare triple {44535#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 150: Hoare triple {44535#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 151: Hoare triple {44535#false} assume 4432 == #t~mem62;havoc #t~mem62; {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 152: Hoare triple {44535#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 153: Hoare triple {44535#false} assume 5 == ~blastFlag~0; {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L290 TraceCheckUtils]: 154: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-15 11:38:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-15 11:38:31,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:31,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982501433] [2022-04-15 11:38:31,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982501433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:31,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:31,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:31,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:31,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809492816] [2022-04-15 11:38:31,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809492816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:31,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:31,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926667617] [2022-04-15 11:38:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 155 [2022-04-15 11:38:31,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:31,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:31,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:31,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:31,310 INFO L87 Difference]: Start difference. First operand 871 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:33,331 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:38:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:34,723 INFO L93 Difference]: Finished difference Result 1980 states and 2921 transitions. [2022-04-15 11:38:34,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:38:34,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 155 [2022-04-15 11:38:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:38:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:38:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-15 11:38:34,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-15 11:38:35,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:35,056 INFO L225 Difference]: With dead ends: 1980 [2022-04-15 11:38:35,056 INFO L226 Difference]: Without dead ends: 1125 [2022-04-15 11:38:35,057 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:38:35,058 INFO L913 BasicCegarLoop]: 235 mSDtfsCounter, 96 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:38:35,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 559 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:38:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-04-15 11:38:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 871. [2022-04-15 11:38:35,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:38:35,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 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:38:35,094 INFO L74 IsIncluded]: Start isIncluded. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 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:38:35,094 INFO L87 Difference]: Start difference. First operand 1125 states. Second operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 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:38:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:35,128 INFO L93 Difference]: Finished difference Result 1125 states and 1649 transitions. [2022-04-15 11:38:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1649 transitions. [2022-04-15 11:38:35,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:35,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:35,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 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 1125 states. [2022-04-15 11:38:35,131 INFO L87 Difference]: Start difference. First operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 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 1125 states. [2022-04-15 11:38:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:38:35,166 INFO L93 Difference]: Finished difference Result 1125 states and 1649 transitions. [2022-04-15 11:38:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1649 transitions. [2022-04-15 11:38:35,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:38:35,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:38:35,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:38:35,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:38:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 866 states have (on average 1.4780600461893765) internal successors, (1280), 866 states have internal predecessors, (1280), 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:38:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1284 transitions. [2022-04-15 11:38:35,199 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1284 transitions. Word has length 155 [2022-04-15 11:38:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:38:35,200 INFO L478 AbstractCegarLoop]: Abstraction has 871 states and 1284 transitions. [2022-04-15 11:38:35,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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:38:35,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1284 transitions. [2022-04-15 11:38:36,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1284 edges. 1284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1284 transitions. [2022-04-15 11:38:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 11:38:36,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:38:36,203 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:38:36,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:38:36,204 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:38:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:38:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1761005295, now seen corresponding path program 1 times [2022-04-15 11:38:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:36,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847966204] [2022-04-15 11:38:49,935 WARN L232 SmtUtils]: Spent 8.73s 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:38:58,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:38:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1761005295, now seen corresponding path program 2 times [2022-04-15 11:38:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:38:58,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448302382] [2022-04-15 11:38:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:38:58,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:38:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:38:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:38:58,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {52505#(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); {52498#true} is VALID [2022-04-15 11:38:58,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {52498#true} assume true; {52498#true} is VALID [2022-04-15 11:38:58,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52498#true} {52498#true} #593#return; {52498#true} is VALID [2022-04-15 11:38:58,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {52498#true} call ULTIMATE.init(); {52505#(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:38:58,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {52505#(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); {52498#true} is VALID [2022-04-15 11:38:58,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {52498#true} assume true; {52498#true} is VALID [2022-04-15 11:38:58,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52498#true} {52498#true} #593#return; {52498#true} is VALID [2022-04-15 11:38:58,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {52498#true} call #t~ret158 := main(); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {52498#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; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {52498#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {52498#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; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {52498#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; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {52498#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {52498#true} assume 12292 == #t~mem49;havoc #t~mem49; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {52498#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; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {52498#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {52498#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {52498#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {52498#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {52498#true} assume !(0 == ~tmp___4~0); {52498#true} is VALID [2022-04-15 11:38:58,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {52498#true} assume 4368 == #t~mem54;havoc #t~mem54; {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {52498#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; {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {52498#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {52498#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; {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {52498#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {52498#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {52498#true} assume 4384 == #t~mem56;havoc #t~mem56; {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {52498#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {52498#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {52498#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {52498#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {52498#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {52498#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {52498#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {52498#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {52498#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {52498#true} assume 4400 == #t~mem58;havoc #t~mem58; {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {52498#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; {52498#true} is VALID [2022-04-15 11:38:58,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {52498#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {52498#true} assume !(~ret~0 <= 0); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 74: Hoare triple {52498#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {52498#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 77: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 79: Hoare triple {52498#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); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {52498#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {52498#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 82: Hoare triple {52498#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {52498#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {52498#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {52498#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 86: Hoare triple {52498#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {52498#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {52498#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {52498#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {52498#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52498#true} is VALID [2022-04-15 11:38:58,776 INFO L290 TraceCheckUtils]: 91: Hoare triple {52498#true} assume 4416 == #t~mem60;havoc #t~mem60; {52498#true} is VALID [2022-04-15 11:38:58,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {52498#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {52498#true} is VALID [2022-04-15 11:38:58,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {52498#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52498#true} is VALID [2022-04-15 11:38:58,777 INFO L290 TraceCheckUtils]: 94: Hoare triple {52498#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {52503#(not (= 20480 (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); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {52503#(not (= 20480 (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; {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,778 INFO L290 TraceCheckUtils]: 98: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,778 INFO L290 TraceCheckUtils]: 99: Hoare triple {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,779 INFO L290 TraceCheckUtils]: 100: Hoare triple {52503#(not (= 20480 (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); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,779 INFO L290 TraceCheckUtils]: 101: Hoare triple {52503#(not (= 20480 (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); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {52503#(not (= 20480 (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); {52503#(not (= 20480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 103: Hoare triple {52503#(not (= 20480 (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); {52504#(not (= |ssl3_connect_#t~mem52| 20480))} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 104: Hoare triple {52504#(not (= |ssl3_connect_#t~mem52| 20480))} assume 20480 == #t~mem52;havoc #t~mem52; {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 105: Hoare triple {52499#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 106: Hoare triple {52499#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 107: Hoare triple {52499#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {52499#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); {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {52499#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 110: Hoare triple {52499#false} assume !(0 == ~tmp___4~0); {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 111: Hoare triple {52499#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); {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 112: Hoare triple {52499#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); {52499#false} is VALID [2022-04-15 11:38:58,780 INFO L290 TraceCheckUtils]: 113: Hoare triple {52499#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 114: Hoare triple {52499#false} ~skip~0 := 0; {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 115: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 116: Hoare triple {52499#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); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 117: Hoare triple {52499#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 118: Hoare triple {52499#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 119: Hoare triple {52499#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 120: Hoare triple {52499#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 121: Hoare triple {52499#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 122: Hoare triple {52499#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 123: Hoare triple {52499#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 124: Hoare triple {52499#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 125: Hoare triple {52499#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 126: Hoare triple {52499#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 127: Hoare triple {52499#false} assume 4401 == #t~mem59;havoc #t~mem59; {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 128: Hoare triple {52499#false} 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); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 129: Hoare triple {52499#false} 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; {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 130: Hoare triple {52499#false} assume !(2 == ~blastFlag~0); {52499#false} is VALID [2022-04-15 11:38:58,781 INFO L290 TraceCheckUtils]: 131: Hoare triple {52499#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 132: Hoare triple {52499#false} assume !(~ret~0 <= 0); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 133: Hoare triple {52499#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 134: Hoare triple {52499#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); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 135: Hoare triple {52499#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 136: Hoare triple {52499#false} ~skip~0 := 0; {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 137: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 138: Hoare triple {52499#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); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 139: Hoare triple {52499#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 140: Hoare triple {52499#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 141: Hoare triple {52499#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 142: Hoare triple {52499#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 143: Hoare triple {52499#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 144: Hoare triple {52499#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 145: Hoare triple {52499#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 146: Hoare triple {52499#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 147: Hoare triple {52499#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,782 INFO L290 TraceCheckUtils]: 148: Hoare triple {52499#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L290 TraceCheckUtils]: 149: Hoare triple {52499#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L290 TraceCheckUtils]: 150: Hoare triple {52499#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L290 TraceCheckUtils]: 151: Hoare triple {52499#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L290 TraceCheckUtils]: 152: Hoare triple {52499#false} assume 4432 == #t~mem62;havoc #t~mem62; {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L290 TraceCheckUtils]: 153: Hoare triple {52499#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L290 TraceCheckUtils]: 154: Hoare triple {52499#false} assume 5 == ~blastFlag~0; {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L290 TraceCheckUtils]: 155: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-15 11:38:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-15 11:38:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:38:58,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448302382] [2022-04-15 11:38:58,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448302382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:58,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:58,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:58,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:38:58,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847966204] [2022-04-15 11:38:58,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847966204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:38:58,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:38:58,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:38:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926001630] [2022-04-15 11:38:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:38:58,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 156 [2022-04-15 11:38:58,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:38:58,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:38:58,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:38:58,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:38:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:38:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:38:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:38:58,855 INFO L87 Difference]: Start difference. First operand 871 states and 1284 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:39:00,876 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:39:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:01,999 INFO L93 Difference]: Finished difference Result 2115 states and 3127 transitions. [2022-04-15 11:39:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:01,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 156 [2022-04-15 11:39:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:39:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:39:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:39:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-15 11:39:02,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-15 11:39:02,299 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:39:02,364 INFO L225 Difference]: With dead ends: 2115 [2022-04-15 11:39:02,364 INFO L226 Difference]: Without dead ends: 1260 [2022-04-15 11:39:02,365 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:39:02,365 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 116 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 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:39:02,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 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:39:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-15 11:39:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 881. [2022-04-15 11:39:02,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:02,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 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:39:02,400 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 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:39:02,400 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 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:39:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:02,441 INFO L93 Difference]: Finished difference Result 1260 states and 1849 transitions. [2022-04-15 11:39:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1849 transitions. [2022-04-15 11:39:02,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:02,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:02,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 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 1260 states. [2022-04-15 11:39:02,445 INFO L87 Difference]: Start difference. First operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 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 1260 states. [2022-04-15 11:39:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:02,486 INFO L93 Difference]: Finished difference Result 1260 states and 1849 transitions. [2022-04-15 11:39:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1849 transitions. [2022-04-15 11:39:02,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:02,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:02,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:02,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 876 states have (on average 1.4680365296803652) internal successors, (1286), 876 states have internal predecessors, (1286), 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:39:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1290 transitions. [2022-04-15 11:39:02,520 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1290 transitions. Word has length 156 [2022-04-15 11:39:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:02,521 INFO L478 AbstractCegarLoop]: Abstraction has 881 states and 1290 transitions. [2022-04-15 11:39:02,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:39:02,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 881 states and 1290 transitions. [2022-04-15 11:39:03,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1290 edges. 1290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1290 transitions. [2022-04-15 11:39:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 11:39:03,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:03,641 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:03,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:39:03,641 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1272587528, now seen corresponding path program 1 times [2022-04-15 11:39:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:03,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637697842] [2022-04-15 11:39:18,382 WARN L232 SmtUtils]: Spent 9.47s 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:39:28,067 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1272587528, now seen corresponding path program 2 times [2022-04-15 11:39:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:28,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645073811] [2022-04-15 11:39:28,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:28,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:28,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:28,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {61029#(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); {61022#true} is VALID [2022-04-15 11:39:28,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {61022#true} assume true; {61022#true} is VALID [2022-04-15 11:39:28,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61022#true} {61022#true} #593#return; {61022#true} is VALID [2022-04-15 11:39:28,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {61022#true} call ULTIMATE.init(); {61029#(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:39:28,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {61029#(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); {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {61022#true} assume true; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61022#true} {61022#true} #593#return; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {61022#true} call #t~ret158 := main(); {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {61022#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; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {61022#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {61022#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; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {61022#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; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {61022#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {61022#true} assume 12292 == #t~mem49;havoc #t~mem49; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {61022#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; {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {61022#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {61022#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {61022#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {61022#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {61022#true} assume !(0 == ~tmp___4~0); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {61022#true} assume 4368 == #t~mem54;havoc #t~mem54; {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {61022#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; {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {61022#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {61022#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; {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {61022#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {61022#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {61022#true} assume 4384 == #t~mem56;havoc #t~mem56; {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {61022#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {61022#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {61022#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {61022#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {61022#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {61022#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {61022#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {61022#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {61022#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {61022#true} assume 4400 == #t~mem58;havoc #t~mem58; {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {61022#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; {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {61022#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {61022#true} assume !(~ret~0 <= 0); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 74: Hoare triple {61022#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 75: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 76: Hoare triple {61022#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 79: Hoare triple {61022#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); {61022#true} is VALID [2022-04-15 11:39:28,276 INFO L290 TraceCheckUtils]: 80: Hoare triple {61022#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 81: Hoare triple {61022#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 82: Hoare triple {61022#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 83: Hoare triple {61022#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 84: Hoare triple {61022#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 85: Hoare triple {61022#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 86: Hoare triple {61022#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 87: Hoare triple {61022#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 88: Hoare triple {61022#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 89: Hoare triple {61022#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 90: Hoare triple {61022#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 91: Hoare triple {61022#true} assume 4416 == #t~mem60;havoc #t~mem60; {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 92: Hoare triple {61022#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {61022#true} is VALID [2022-04-15 11:39:28,277 INFO L290 TraceCheckUtils]: 93: Hoare triple {61022#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {61022#true} is VALID [2022-04-15 11:39:28,278 INFO L290 TraceCheckUtils]: 94: Hoare triple {61022#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,279 INFO L290 TraceCheckUtils]: 95: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,279 INFO L290 TraceCheckUtils]: 96: Hoare triple {61027#(not (= 4099 (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); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,279 INFO L290 TraceCheckUtils]: 97: Hoare triple {61027#(not (= 4099 (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; {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,279 INFO L290 TraceCheckUtils]: 98: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,279 INFO L290 TraceCheckUtils]: 99: Hoare triple {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,280 INFO L290 TraceCheckUtils]: 100: Hoare triple {61027#(not (= 4099 (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); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,280 INFO L290 TraceCheckUtils]: 101: Hoare triple {61027#(not (= 4099 (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); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,280 INFO L290 TraceCheckUtils]: 102: Hoare triple {61027#(not (= 4099 (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); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,280 INFO L290 TraceCheckUtils]: 103: Hoare triple {61027#(not (= 4099 (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); {61027#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 104: Hoare triple {61027#(not (= 4099 (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); {61028#(not (= |ssl3_connect_#t~mem53| 4099))} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 105: Hoare triple {61028#(not (= |ssl3_connect_#t~mem53| 4099))} assume 4099 == #t~mem53;havoc #t~mem53; {61023#false} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 106: Hoare triple {61023#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 107: Hoare triple {61023#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61023#false} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 108: Hoare triple {61023#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 109: Hoare triple {61023#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); {61023#false} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 110: Hoare triple {61023#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {61023#false} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 111: Hoare triple {61023#false} assume !(0 == ~tmp___4~0); {61023#false} is VALID [2022-04-15 11:39:28,281 INFO L290 TraceCheckUtils]: 112: Hoare triple {61023#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); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 113: Hoare triple {61023#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); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 114: Hoare triple {61023#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 115: Hoare triple {61023#false} ~skip~0 := 0; {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 116: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 117: Hoare triple {61023#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); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 118: Hoare triple {61023#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 119: Hoare triple {61023#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 120: Hoare triple {61023#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 121: Hoare triple {61023#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 122: Hoare triple {61023#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 123: Hoare triple {61023#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 124: Hoare triple {61023#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 125: Hoare triple {61023#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 126: Hoare triple {61023#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 127: Hoare triple {61023#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,282 INFO L290 TraceCheckUtils]: 128: Hoare triple {61023#false} assume 4401 == #t~mem59;havoc #t~mem59; {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 129: Hoare triple {61023#false} 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); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 130: Hoare triple {61023#false} 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; {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 131: Hoare triple {61023#false} assume !(2 == ~blastFlag~0); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 132: Hoare triple {61023#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 133: Hoare triple {61023#false} assume !(~ret~0 <= 0); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 134: Hoare triple {61023#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 135: Hoare triple {61023#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); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 136: Hoare triple {61023#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 137: Hoare triple {61023#false} ~skip~0 := 0; {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 138: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 139: Hoare triple {61023#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); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 140: Hoare triple {61023#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 141: Hoare triple {61023#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 142: Hoare triple {61023#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,283 INFO L290 TraceCheckUtils]: 143: Hoare triple {61023#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 144: Hoare triple {61023#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 145: Hoare triple {61023#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 146: Hoare triple {61023#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 147: Hoare triple {61023#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 148: Hoare triple {61023#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 149: Hoare triple {61023#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 150: Hoare triple {61023#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 151: Hoare triple {61023#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 152: Hoare triple {61023#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 153: Hoare triple {61023#false} assume 4432 == #t~mem62;havoc #t~mem62; {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 154: Hoare triple {61023#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 155: Hoare triple {61023#false} assume 5 == ~blastFlag~0; {61023#false} is VALID [2022-04-15 11:39:28,284 INFO L290 TraceCheckUtils]: 156: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-15 11:39:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-04-15 11:39:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:28,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645073811] [2022-04-15 11:39:28,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645073811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:28,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:28,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:28,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:28,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637697842] [2022-04-15 11:39:28,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637697842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:28,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:28,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143799311] [2022-04-15 11:39:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:28,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 157 [2022-04-15 11:39:28,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:28,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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:39:28,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:28,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:28,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:28,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:28,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:28,364 INFO L87 Difference]: Start difference. First operand 881 states and 1290 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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:39:30,390 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:39:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:31,475 INFO L93 Difference]: Finished difference Result 2125 states and 3119 transitions. [2022-04-15 11:39:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 157 [2022-04-15 11:39:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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:39:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:39:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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:39:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:39:31,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 11:39:31,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:31,845 INFO L225 Difference]: With dead ends: 2125 [2022-04-15 11:39:31,845 INFO L226 Difference]: Without dead ends: 1260 [2022-04-15 11:39:31,846 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:39:31,847 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 114 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:31,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:39:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-15 11:39:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 886. [2022-04-15 11:39:31,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:31,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 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:39:31,887 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 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:39:31,889 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 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:39:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:31,931 INFO L93 Difference]: Finished difference Result 1260 states and 1835 transitions. [2022-04-15 11:39:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1835 transitions. [2022-04-15 11:39:31,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:31,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:31,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 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 1260 states. [2022-04-15 11:39:31,939 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 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 1260 states. [2022-04-15 11:39:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:31,981 INFO L93 Difference]: Finished difference Result 1260 states and 1835 transitions. [2022-04-15 11:39:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1835 transitions. [2022-04-15 11:39:31,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:31,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:31,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:31,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 881 states have internal predecessors, (1282), 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:39:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1286 transitions. [2022-04-15 11:39:32,015 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1286 transitions. Word has length 157 [2022-04-15 11:39:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:32,015 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1286 transitions. [2022-04-15 11:39:32,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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:39:32,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1286 transitions. [2022-04-15 11:39:33,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1286 edges. 1286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1286 transitions. [2022-04-15 11:39:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 11:39:33,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:33,114 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:33,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:39:33,114 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1472512973, now seen corresponding path program 1 times [2022-04-15 11:39:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:33,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717086436] [2022-04-15 11:39:45,497 WARN L232 SmtUtils]: Spent 8.96s 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:39:56,279 WARN L232 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:39:58,835 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1472512973, now seen corresponding path program 2 times [2022-04-15 11:39:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:58,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109906308] [2022-04-15 11:39:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:59,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {69583#(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); {69576#true} is VALID [2022-04-15 11:39:59,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {69576#true} assume true; {69576#true} is VALID [2022-04-15 11:39:59,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69576#true} {69576#true} #593#return; {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {69576#true} call ULTIMATE.init(); {69583#(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:39:59,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {69583#(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); {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {69576#true} assume true; {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69576#true} {69576#true} #593#return; {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {69576#true} call #t~ret158 := main(); {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {69576#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; {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L272 TraceCheckUtils]: 6: Hoare triple {69576#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {69576#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; {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {69576#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; {69576#true} is VALID [2022-04-15 11:39:59,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {69576#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {69576#true} assume 12292 == #t~mem49;havoc #t~mem49; {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {69576#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; {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {69576#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {69576#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {69576#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {69576#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {69576#true} assume !(0 == ~tmp___4~0); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {69576#true} assume 4368 == #t~mem54;havoc #t~mem54; {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {69576#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; {69576#true} is VALID [2022-04-15 11:39:59,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {69576#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {69576#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; {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {69576#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {69576#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {69576#true} assume 4384 == #t~mem56;havoc #t~mem56; {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {69576#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {69576#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {69576#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {69576#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {69576#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-15 11:39:59,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 65: Hoare triple {69576#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {69576#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 67: Hoare triple {69576#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {69576#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 69: Hoare triple {69576#true} assume 4400 == #t~mem58;havoc #t~mem58; {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 70: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 71: Hoare triple {69576#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; {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 72: Hoare triple {69576#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 73: Hoare triple {69576#true} assume !(~ret~0 <= 0); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 74: Hoare triple {69576#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 75: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,027 INFO L290 TraceCheckUtils]: 76: Hoare triple {69576#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 78: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 79: Hoare triple {69576#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); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {69576#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {69576#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 82: Hoare triple {69576#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 83: Hoare triple {69576#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 84: Hoare triple {69576#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 85: Hoare triple {69576#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 86: Hoare triple {69576#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 87: Hoare triple {69576#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 88: Hoare triple {69576#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 89: Hoare triple {69576#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 90: Hoare triple {69576#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 91: Hoare triple {69576#true} assume 4416 == #t~mem60;havoc #t~mem60; {69576#true} is VALID [2022-04-15 11:39:59,028 INFO L290 TraceCheckUtils]: 92: Hoare triple {69576#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {69576#true} is VALID [2022-04-15 11:39:59,029 INFO L290 TraceCheckUtils]: 93: Hoare triple {69576#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {69576#true} is VALID [2022-04-15 11:39:59,029 INFO L290 TraceCheckUtils]: 94: Hoare triple {69576#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,030 INFO L290 TraceCheckUtils]: 95: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,030 INFO L290 TraceCheckUtils]: 96: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,030 INFO L290 TraceCheckUtils]: 97: Hoare triple {69581#(= 4432 (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; {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,030 INFO L290 TraceCheckUtils]: 98: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,031 INFO L290 TraceCheckUtils]: 99: Hoare triple {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,031 INFO L290 TraceCheckUtils]: 100: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,031 INFO L290 TraceCheckUtils]: 101: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,031 INFO L290 TraceCheckUtils]: 102: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,032 INFO L290 TraceCheckUtils]: 103: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,032 INFO L290 TraceCheckUtils]: 104: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,032 INFO L290 TraceCheckUtils]: 105: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,032 INFO L290 TraceCheckUtils]: 106: Hoare triple {69581#(= 4432 (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); {69581#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 107: Hoare triple {69581#(= 4432 (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); {69582#(= |ssl3_connect_#t~mem56| 4432)} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 108: Hoare triple {69582#(= |ssl3_connect_#t~mem56| 4432)} assume 4384 == #t~mem56;havoc #t~mem56; {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 109: Hoare triple {69577#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 110: Hoare triple {69577#false} assume !(1 == ~blastFlag~0); {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 111: Hoare triple {69577#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 112: Hoare triple {69577#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 113: Hoare triple {69577#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 114: Hoare triple {69577#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); {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 115: Hoare triple {69577#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69577#false} is VALID [2022-04-15 11:39:59,033 INFO L290 TraceCheckUtils]: 116: Hoare triple {69577#false} ~skip~0 := 0; {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 117: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 118: Hoare triple {69577#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); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 119: Hoare triple {69577#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 120: Hoare triple {69577#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 121: Hoare triple {69577#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 122: Hoare triple {69577#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 123: Hoare triple {69577#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 124: Hoare triple {69577#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 125: Hoare triple {69577#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 126: Hoare triple {69577#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 127: Hoare triple {69577#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 128: Hoare triple {69577#false} assume 4400 == #t~mem58;havoc #t~mem58; {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 129: Hoare triple {69577#false} 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); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 130: Hoare triple {69577#false} 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; {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 131: Hoare triple {69577#false} assume !(2 == ~blastFlag~0); {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 132: Hoare triple {69577#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {69577#false} is VALID [2022-04-15 11:39:59,034 INFO L290 TraceCheckUtils]: 133: Hoare triple {69577#false} assume !(~ret~0 <= 0); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 134: Hoare triple {69577#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 135: Hoare triple {69577#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); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 136: Hoare triple {69577#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 137: Hoare triple {69577#false} ~skip~0 := 0; {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 138: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 139: Hoare triple {69577#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); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 140: Hoare triple {69577#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 141: Hoare triple {69577#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 142: Hoare triple {69577#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 143: Hoare triple {69577#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 144: Hoare triple {69577#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 145: Hoare triple {69577#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 146: Hoare triple {69577#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 147: Hoare triple {69577#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,035 INFO L290 TraceCheckUtils]: 148: Hoare triple {69577#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 149: Hoare triple {69577#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 150: Hoare triple {69577#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 151: Hoare triple {69577#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 152: Hoare triple {69577#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 153: Hoare triple {69577#false} assume 4432 == #t~mem62;havoc #t~mem62; {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 154: Hoare triple {69577#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 155: Hoare triple {69577#false} assume 5 == ~blastFlag~0; {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L290 TraceCheckUtils]: 156: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-15 11:39:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-15 11:39:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:59,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109906308] [2022-04-15 11:39:59,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109906308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:59,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:59,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:59,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:59,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717086436] [2022-04-15 11:39:59,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717086436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:59,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:59,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834535988] [2022-04-15 11:39:59,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:59,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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 157 [2022-04-15 11:39:59,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:59,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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:39:59,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:59,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:59,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:59,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:59,106 INFO L87 Difference]: Start difference. First operand 886 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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:40:01,128 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:40:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:02,475 INFO L93 Difference]: Finished difference Result 1974 states and 2873 transitions. [2022-04-15 11:40:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:02,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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 157 [2022-04-15 11:40:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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:40:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-04-15 11:40:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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:40:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-04-15 11:40:02,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 447 transitions. [2022-04-15 11:40:02,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 447 edges. 447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:02,817 INFO L225 Difference]: With dead ends: 1974 [2022-04-15 11:40:02,818 INFO L226 Difference]: Without dead ends: 1104 [2022-04-15 11:40:02,819 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:40:02,819 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 81 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:02,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 541 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 503 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:40:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-04-15 11:40:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 886. [2022-04-15 11:40:02,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:02,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 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:40:02,858 INFO L74 IsIncluded]: Start isIncluded. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 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:40:02,859 INFO L87 Difference]: Start difference. First operand 1104 states. Second operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 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:40:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:02,892 INFO L93 Difference]: Finished difference Result 1104 states and 1603 transitions. [2022-04-15 11:40:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1603 transitions. [2022-04-15 11:40:02,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:02,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:02,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 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 1104 states. [2022-04-15 11:40:02,895 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 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 1104 states. [2022-04-15 11:40:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:02,935 INFO L93 Difference]: Finished difference Result 1104 states and 1603 transitions. [2022-04-15 11:40:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1603 transitions. [2022-04-15 11:40:02,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:02,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:02,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:02,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.4506242905788875) internal successors, (1278), 881 states have internal predecessors, (1278), 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:40:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1282 transitions. [2022-04-15 11:40:02,970 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1282 transitions. Word has length 157 [2022-04-15 11:40:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:02,970 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1282 transitions. [2022-04-15 11:40:02,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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:40:02,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1282 transitions. [2022-04-15 11:40:04,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1282 edges. 1282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1282 transitions. [2022-04-15 11:40:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-15 11:40:04,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:04,046 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:40:04,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:40:04,046 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1600786980, now seen corresponding path program 1 times [2022-04-15 11:40:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:04,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1786622334] [2022-04-15 11:40:21,899 WARN L232 SmtUtils]: Spent 14.05s 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:40:31,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1600786980, now seen corresponding path program 2 times [2022-04-15 11:40:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301854651] [2022-04-15 11:40:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:31,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {77523#(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); {77516#true} is VALID [2022-04-15 11:40:31,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {77516#true} assume true; {77516#true} is VALID [2022-04-15 11:40:31,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77516#true} {77516#true} #593#return; {77516#true} is VALID [2022-04-15 11:40:31,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {77516#true} call ULTIMATE.init(); {77523#(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:40:31,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {77523#(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); {77516#true} is VALID [2022-04-15 11:40:31,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {77516#true} assume true; {77516#true} is VALID [2022-04-15 11:40:31,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77516#true} {77516#true} #593#return; {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {77516#true} call #t~ret158 := main(); {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {77516#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; {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L272 TraceCheckUtils]: 6: Hoare triple {77516#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {77516#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; {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {77516#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; {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {77516#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-15 11:40:31,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {77516#true} assume 12292 == #t~mem49;havoc #t~mem49; {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {77516#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; {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {77516#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {77516#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {77516#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {77516#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {77516#true} assume !(0 == ~tmp___4~0); {77516#true} is VALID [2022-04-15 11:40:31,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {77516#true} assume 4368 == #t~mem54;havoc #t~mem54; {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {77516#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; {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {77516#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {77516#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; {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-15 11:40:31,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {77516#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {77516#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {77516#true} assume 4384 == #t~mem56;havoc #t~mem56; {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {77516#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {77516#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {77516#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {77516#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {77516#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-15 11:40:31,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 65: Hoare triple {77516#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 66: Hoare triple {77516#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 67: Hoare triple {77516#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {77516#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {77516#true} assume 4400 == #t~mem58;havoc #t~mem58; {77516#true} is VALID [2022-04-15 11:40:31,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {77516#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; {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 72: Hoare triple {77516#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {77516#true} assume !(~ret~0 <= 0); {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {77516#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {77516#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 79: Hoare triple {77516#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); {77516#true} is VALID [2022-04-15 11:40:31,754 INFO L290 TraceCheckUtils]: 80: Hoare triple {77516#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 81: Hoare triple {77516#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 82: Hoare triple {77516#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 83: Hoare triple {77516#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {77516#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {77516#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {77516#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {77516#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {77516#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,755 INFO L290 TraceCheckUtils]: 89: Hoare triple {77516#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,756 INFO L290 TraceCheckUtils]: 90: Hoare triple {77516#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77516#true} is VALID [2022-04-15 11:40:31,756 INFO L290 TraceCheckUtils]: 91: Hoare triple {77516#true} assume 4416 == #t~mem60;havoc #t~mem60; {77516#true} is VALID [2022-04-15 11:40:31,756 INFO L290 TraceCheckUtils]: 92: Hoare triple {77516#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {77516#true} is VALID [2022-04-15 11:40:31,756 INFO L290 TraceCheckUtils]: 93: Hoare triple {77516#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {77516#true} is VALID [2022-04-15 11:40:31,757 INFO L290 TraceCheckUtils]: 94: Hoare triple {77516#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,757 INFO L290 TraceCheckUtils]: 95: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,758 INFO L290 TraceCheckUtils]: 97: Hoare triple {77521#(= 4432 (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; {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,759 INFO L290 TraceCheckUtils]: 99: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,759 INFO L290 TraceCheckUtils]: 100: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,759 INFO L290 TraceCheckUtils]: 101: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,760 INFO L290 TraceCheckUtils]: 102: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,760 INFO L290 TraceCheckUtils]: 103: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,760 INFO L290 TraceCheckUtils]: 104: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,760 INFO L290 TraceCheckUtils]: 105: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,761 INFO L290 TraceCheckUtils]: 106: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,761 INFO L290 TraceCheckUtils]: 107: Hoare triple {77521#(= 4432 (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); {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:31,762 INFO L290 TraceCheckUtils]: 108: Hoare triple {77521#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77522#(= |ssl3_connect_#t~mem57| 4432)} is VALID [2022-04-15 11:40:31,762 INFO L290 TraceCheckUtils]: 109: Hoare triple {77522#(= |ssl3_connect_#t~mem57| 4432)} assume 4385 == #t~mem57;havoc #t~mem57; {77517#false} is VALID [2022-04-15 11:40:31,762 INFO L290 TraceCheckUtils]: 110: Hoare triple {77517#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {77517#false} is VALID [2022-04-15 11:40:31,762 INFO L290 TraceCheckUtils]: 111: Hoare triple {77517#false} assume !(1 == ~blastFlag~0); {77517#false} is VALID [2022-04-15 11:40:31,762 INFO L290 TraceCheckUtils]: 112: Hoare triple {77517#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,762 INFO L290 TraceCheckUtils]: 113: Hoare triple {77517#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {77517#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 115: Hoare triple {77517#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); {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 116: Hoare triple {77517#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 117: Hoare triple {77517#false} ~skip~0 := 0; {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 118: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 119: Hoare triple {77517#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); {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 120: Hoare triple {77517#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 121: Hoare triple {77517#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 122: Hoare triple {77517#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,763 INFO L290 TraceCheckUtils]: 123: Hoare triple {77517#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 124: Hoare triple {77517#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 125: Hoare triple {77517#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 126: Hoare triple {77517#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 127: Hoare triple {77517#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 128: Hoare triple {77517#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 129: Hoare triple {77517#false} assume 4400 == #t~mem58;havoc #t~mem58; {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 130: Hoare triple {77517#false} 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); {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 131: Hoare triple {77517#false} 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; {77517#false} is VALID [2022-04-15 11:40:31,764 INFO L290 TraceCheckUtils]: 132: Hoare triple {77517#false} assume !(2 == ~blastFlag~0); {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 133: Hoare triple {77517#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 134: Hoare triple {77517#false} assume !(~ret~0 <= 0); {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 135: Hoare triple {77517#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 136: Hoare triple {77517#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); {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 137: Hoare triple {77517#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 138: Hoare triple {77517#false} ~skip~0 := 0; {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 139: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 140: Hoare triple {77517#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); {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 141: Hoare triple {77517#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,765 INFO L290 TraceCheckUtils]: 142: Hoare triple {77517#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 143: Hoare triple {77517#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 144: Hoare triple {77517#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 145: Hoare triple {77517#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 146: Hoare triple {77517#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 147: Hoare triple {77517#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 148: Hoare triple {77517#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 149: Hoare triple {77517#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 150: Hoare triple {77517#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,766 INFO L290 TraceCheckUtils]: 151: Hoare triple {77517#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,767 INFO L290 TraceCheckUtils]: 152: Hoare triple {77517#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,767 INFO L290 TraceCheckUtils]: 153: Hoare triple {77517#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {77517#false} is VALID [2022-04-15 11:40:31,767 INFO L290 TraceCheckUtils]: 154: Hoare triple {77517#false} assume 4432 == #t~mem62;havoc #t~mem62; {77517#false} is VALID [2022-04-15 11:40:31,767 INFO L290 TraceCheckUtils]: 155: Hoare triple {77517#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {77517#false} is VALID [2022-04-15 11:40:31,767 INFO L290 TraceCheckUtils]: 156: Hoare triple {77517#false} assume 5 == ~blastFlag~0; {77517#false} is VALID [2022-04-15 11:40:31,767 INFO L290 TraceCheckUtils]: 157: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-15 11:40:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-04-15 11:40:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:31,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301854651] [2022-04-15 11:40:31,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301854651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:31,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:31,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:31,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:31,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1786622334] [2022-04-15 11:40:31,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1786622334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:31,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:31,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92301870] [2022-04-15 11:40:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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 158 [2022-04-15 11:40:31,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:31,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:40:31,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:31,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:31,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:31,852 INFO L87 Difference]: Start difference. First operand 886 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:40:33,875 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:40:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:35,153 INFO L93 Difference]: Finished difference Result 1958 states and 2844 transitions. [2022-04-15 11:40:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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 158 [2022-04-15 11:40:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:40:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:40:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:40:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:40:35,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-15 11:40:35,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:35,466 INFO L225 Difference]: With dead ends: 1958 [2022-04-15 11:40:35,466 INFO L226 Difference]: Without dead ends: 1088 [2022-04-15 11:40:35,467 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:40:35,468 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 75 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:35,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 533 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:40:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2022-04-15 11:40:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 886. [2022-04-15 11:40:35,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:35,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1088 states. Second operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 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:40:35,513 INFO L74 IsIncluded]: Start isIncluded. First operand 1088 states. Second operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 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:40:35,514 INFO L87 Difference]: Start difference. First operand 1088 states. Second operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 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:40:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:35,545 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2022-04-15 11:40:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1578 transitions. [2022-04-15 11:40:35,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:35,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:35,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 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 1088 states. [2022-04-15 11:40:35,548 INFO L87 Difference]: Start difference. First operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 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 1088 states. [2022-04-15 11:40:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:35,580 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2022-04-15 11:40:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1578 transitions. [2022-04-15 11:40:35,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:35,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:35,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:35,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 881 states have (on average 1.446083995459705) internal successors, (1274), 881 states have internal predecessors, (1274), 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:40:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1278 transitions. [2022-04-15 11:40:35,614 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1278 transitions. Word has length 158 [2022-04-15 11:40:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:35,614 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1278 transitions. [2022-04-15 11:40:35,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 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:40:35,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1278 transitions. [2022-04-15 11:40:36,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1278 edges. 1278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1278 transitions. [2022-04-15 11:40:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-15 11:40:36,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:36,743 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:40:36,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:40:36,744 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -500107939, now seen corresponding path program 1 times [2022-04-15 11:40:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:36,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903163639] [2022-04-15 11:40:49,632 WARN L232 SmtUtils]: Spent 8.92s 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:40:58,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -500107939, now seen corresponding path program 2 times [2022-04-15 11:40:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506464824] [2022-04-15 11:40:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:58,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {85402#(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); {85392#true} is VALID [2022-04-15 11:40:58,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-15 11:40:58,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85402#(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:40:58,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {85402#(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); {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {85392#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {85392#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {85392#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-15 11:40:58,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-15 11:40:58,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {85392#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {85392#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {85392#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 55: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 81: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 82: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 83: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 89: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 90: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 92: Hoare triple {85392#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 94: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 96: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 97: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 100: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 101: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 102: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,470 INFO L290 TraceCheckUtils]: 103: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 104: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 105: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 106: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 107: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 108: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 109: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 110: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,471 INFO L290 TraceCheckUtils]: 111: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85397#(= |ssl3_connect_#t~mem60| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 112: Hoare triple {85397#(= |ssl3_connect_#t~mem60| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85398#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 113: Hoare triple {85398#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85399#(not (= |ssl3_connect_#t~mem62| 4416))} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 114: Hoare triple {85399#(not (= |ssl3_connect_#t~mem62| 4416))} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 115: Hoare triple {85392#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85392#true} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 117: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 118: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 119: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:40:58,472 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 122: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 123: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 124: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 125: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 126: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 127: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 128: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 129: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 130: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 131: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 132: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 134: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 135: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-15 11:40:58,473 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-15 11:40:58,474 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-15 11:40:58,474 INFO L290 TraceCheckUtils]: 139: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,475 INFO L290 TraceCheckUtils]: 140: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,475 INFO L290 TraceCheckUtils]: 141: Hoare triple {85400#(not (= 4432 (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; {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,475 INFO L290 TraceCheckUtils]: 142: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,475 INFO L290 TraceCheckUtils]: 143: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,476 INFO L290 TraceCheckUtils]: 144: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,476 INFO L290 TraceCheckUtils]: 145: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,476 INFO L290 TraceCheckUtils]: 146: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,476 INFO L290 TraceCheckUtils]: 147: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,477 INFO L290 TraceCheckUtils]: 148: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,477 INFO L290 TraceCheckUtils]: 149: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,477 INFO L290 TraceCheckUtils]: 150: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,477 INFO L290 TraceCheckUtils]: 151: Hoare triple {85400#(not (= 4432 (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); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,478 INFO L290 TraceCheckUtils]: 152: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,478 INFO L290 TraceCheckUtils]: 153: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,478 INFO L290 TraceCheckUtils]: 154: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,478 INFO L290 TraceCheckUtils]: 155: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,479 INFO L290 TraceCheckUtils]: 156: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:40:58,479 INFO L290 TraceCheckUtils]: 157: Hoare triple {85400#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85401#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-15 11:40:58,479 INFO L290 TraceCheckUtils]: 158: Hoare triple {85401#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {85393#false} is VALID [2022-04-15 11:40:58,479 INFO L290 TraceCheckUtils]: 159: Hoare triple {85393#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85393#false} is VALID [2022-04-15 11:40:58,479 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-15 11:40:58,479 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-15 11:40:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 94 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-15 11:40:58,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:58,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506464824] [2022-04-15 11:40:58,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506464824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:40:58,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385239890] [2022-04-15 11:40:58,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:40:58,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:40:58,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:40:58,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:40:58,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 11:41:43,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:41:43,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:41:43,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 11:41:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:43,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:41:43,532 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:41:43,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 11:41:43,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 11:41:43,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:41:43,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:41:43,742 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-15 11:41:43,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 21 [2022-04-15 11:41:43,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:41:43,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:41:43,813 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:41:43,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:41:44,066 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:41:44,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-15 11:41:44,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:41:44,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85392#true} is VALID [2022-04-15 11:41:44,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {85392#true} #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); {85392#true} is VALID [2022-04-15 11:41:44,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-15 11:41:44,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-15 11:41:44,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-15 11:41:44,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {85392#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {85392#true} is VALID [2022-04-15 11:41:44,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {85392#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {85392#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {85392#true} is VALID [2022-04-15 11:41:44,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-15 11:41:44,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {85392#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); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {85469#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 42: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {85392#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {85392#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 53: Hoare triple {85392#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 55: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 56: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 59: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 60: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 63: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 64: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 66: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 71: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,176 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 74: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 75: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 76: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 79: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 81: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 82: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 83: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 84: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 85: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 86: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,177 INFO L290 TraceCheckUtils]: 87: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 88: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 89: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 90: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 92: Hoare triple {85392#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 94: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 97: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 100: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,178 INFO L290 TraceCheckUtils]: 101: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 102: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 103: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 104: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 105: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 106: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 107: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 108: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 109: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 110: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 111: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 112: Hoare triple {85392#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 113: Hoare triple {85392#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 114: Hoare triple {85392#true} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-15 11:41:44,179 INFO L290 TraceCheckUtils]: 115: Hoare triple {85392#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 117: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 118: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 119: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 122: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 123: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 124: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 125: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 126: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 127: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 128: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 129: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,180 INFO L290 TraceCheckUtils]: 130: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 131: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 132: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 134: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 135: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-15 11:41:44,181 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-15 11:41:44,182 INFO L290 TraceCheckUtils]: 139: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,182 INFO L290 TraceCheckUtils]: 140: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} 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); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,182 INFO L290 TraceCheckUtils]: 141: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,183 INFO L290 TraceCheckUtils]: 142: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} ~skip~0 := 0; {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,183 INFO L290 TraceCheckUtils]: 143: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !false; {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,183 INFO L290 TraceCheckUtils]: 144: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} 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); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,184 INFO L290 TraceCheckUtils]: 145: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,184 INFO L290 TraceCheckUtils]: 146: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,184 INFO L290 TraceCheckUtils]: 147: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,184 INFO L290 TraceCheckUtils]: 148: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,185 INFO L290 TraceCheckUtils]: 149: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,185 INFO L290 TraceCheckUtils]: 150: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,185 INFO L290 TraceCheckUtils]: 151: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,185 INFO L290 TraceCheckUtils]: 152: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,186 INFO L290 TraceCheckUtils]: 153: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,186 INFO L290 TraceCheckUtils]: 154: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,186 INFO L290 TraceCheckUtils]: 155: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,186 INFO L290 TraceCheckUtils]: 156: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} is VALID [2022-04-15 11:41:44,187 INFO L290 TraceCheckUtils]: 157: Hoare triple {85824#(<= (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4416)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85879#(<= |ssl3_connect_#t~mem62| 4416)} is VALID [2022-04-15 11:41:44,187 INFO L290 TraceCheckUtils]: 158: Hoare triple {85879#(<= |ssl3_connect_#t~mem62| 4416)} assume 4432 == #t~mem62;havoc #t~mem62; {85393#false} is VALID [2022-04-15 11:41:44,187 INFO L290 TraceCheckUtils]: 159: Hoare triple {85393#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85393#false} is VALID [2022-04-15 11:41:44,187 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-15 11:41:44,187 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-15 11:41:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 89 proven. 60 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-04-15 11:41:44,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:41:44,524 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-15 11:41:44,524 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-15 11:41:44,525 INFO L290 TraceCheckUtils]: 159: Hoare triple {85393#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85393#false} is VALID [2022-04-15 11:41:44,525 INFO L290 TraceCheckUtils]: 158: Hoare triple {85901#(not (<= 4432 |ssl3_connect_#t~mem62|))} assume 4432 == #t~mem62;havoc #t~mem62; {85393#false} is VALID [2022-04-15 11:41:44,525 INFO L290 TraceCheckUtils]: 157: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85901#(not (<= 4432 |ssl3_connect_#t~mem62|))} is VALID [2022-04-15 11:41:44,526 INFO L290 TraceCheckUtils]: 156: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,526 INFO L290 TraceCheckUtils]: 155: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,526 INFO L290 TraceCheckUtils]: 154: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,526 INFO L290 TraceCheckUtils]: 153: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,527 INFO L290 TraceCheckUtils]: 152: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,527 INFO L290 TraceCheckUtils]: 151: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,527 INFO L290 TraceCheckUtils]: 150: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,528 INFO L290 TraceCheckUtils]: 149: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,528 INFO L290 TraceCheckUtils]: 148: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,528 INFO L290 TraceCheckUtils]: 147: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,528 INFO L290 TraceCheckUtils]: 146: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,529 INFO L290 TraceCheckUtils]: 145: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,529 INFO L290 TraceCheckUtils]: 144: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} 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); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,529 INFO L290 TraceCheckUtils]: 143: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !false; {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,530 INFO L290 TraceCheckUtils]: 142: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} ~skip~0 := 0; {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,530 INFO L290 TraceCheckUtils]: 141: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,530 INFO L290 TraceCheckUtils]: 140: Hoare triple {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} 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); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,531 INFO L290 TraceCheckUtils]: 139: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85905#(< (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)) 4432)} is VALID [2022-04-15 11:41:44,531 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-15 11:41:44,531 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-15 11:41:44,531 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-15 11:41:44,534 INFO L290 TraceCheckUtils]: 135: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,534 INFO L290 TraceCheckUtils]: 134: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,534 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-15 11:41:44,534 INFO L290 TraceCheckUtils]: 132: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 131: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 130: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 129: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 128: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 127: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 126: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 125: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 124: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 123: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 122: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 119: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 118: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 117: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,535 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 115: Hoare triple {85392#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 114: Hoare triple {85392#true} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 113: Hoare triple {85392#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 112: Hoare triple {85392#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 111: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 110: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 109: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 108: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 107: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 106: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,536 INFO L290 TraceCheckUtils]: 105: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 104: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 103: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 102: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 101: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 100: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 97: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 96: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 94: Hoare triple {85392#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 92: Hoare triple {85392#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 90: Hoare triple {85392#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,537 INFO L290 TraceCheckUtils]: 89: Hoare triple {85392#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 88: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 87: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 85: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 84: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 83: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 82: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 80: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 79: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 75: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {85392#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 71: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {85392#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {85392#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,539 INFO L290 TraceCheckUtils]: 64: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 63: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {85392#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {85392#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {85392#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {85392#true} is VALID [2022-04-15 11:41:44,540 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {85392#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {85392#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {85392#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {85392#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {85392#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {85392#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {85392#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {85392#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-15 11:41:44,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {85392#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {85392#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {85392#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); {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {85392#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {85392#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; {85392#true} is VALID [2022-04-15 11:41:44,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-15 11:41:44,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-15 11:41:44,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-15 11:41:44,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {85392#true} #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); {85392#true} is VALID [2022-04-15 11:41:44,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85392#true} is VALID [2022-04-15 11:41:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 11:41:44,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385239890] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:41:44,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:41:44,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 13 [2022-04-15 11:41:44,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903163639] [2022-04-15 11:41:44,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903163639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:44,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:44,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:41:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548151993] [2022-04-15 11:41:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:44,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 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 162 [2022-04-15 11:41:44,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:44,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 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:41:44,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:44,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:41:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:44,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:41:44,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:41:44,606 INFO L87 Difference]: Start difference. First operand 886 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 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:41:50,668 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:41:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:51,952 INFO L93 Difference]: Finished difference Result 2234 states and 3239 transitions. [2022-04-15 11:41:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:41:51,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 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 162 [2022-04-15 11:41:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 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:41:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-15 11:41:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 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:41:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-15 11:41:51,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 472 transitions. [2022-04-15 11:41:52,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:52,369 INFO L225 Difference]: With dead ends: 2234 [2022-04-15 11:41:52,369 INFO L226 Difference]: Without dead ends: 1364 [2022-04-15 11:41:52,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:41:52,370 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 95 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:41:52,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 312 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:41:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-04-15 11:41:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1036. [2022-04-15 11:41:52,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:41:52,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1364 states. Second operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 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:41:52,730 INFO L74 IsIncluded]: Start isIncluded. First operand 1364 states. Second operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 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:41:52,730 INFO L87 Difference]: Start difference. First operand 1364 states. Second operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 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:41:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:52,779 INFO L93 Difference]: Finished difference Result 1364 states and 1976 transitions. [2022-04-15 11:41:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1976 transitions. [2022-04-15 11:41:52,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:52,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:52,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 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 1364 states. [2022-04-15 11:41:52,782 INFO L87 Difference]: Start difference. First operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 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 1364 states. [2022-04-15 11:41:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:52,830 INFO L93 Difference]: Finished difference Result 1364 states and 1976 transitions. [2022-04-15 11:41:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1976 transitions. [2022-04-15 11:41:52,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:52,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:52,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:41:52,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:41:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1031 states have (on average 1.4684772065955383) internal successors, (1514), 1031 states have internal predecessors, (1514), 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:41:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1518 transitions. [2022-04-15 11:41:52,884 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1518 transitions. Word has length 162 [2022-04-15 11:41:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:41:52,884 INFO L478 AbstractCegarLoop]: Abstraction has 1036 states and 1518 transitions. [2022-04-15 11:41:52,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 1 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:41:52,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1036 states and 1518 transitions. [2022-04-15 11:41:54,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1518 edges. 1518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1518 transitions. [2022-04-15 11:41:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-15 11:41:54,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:41:54,223 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:41:54,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 11:41:54,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:41:54,424 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:41:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:41:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1671837310, now seen corresponding path program 1 times [2022-04-15 11:41:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:54,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702083084] [2022-04-15 11:42:07,721 WARN L232 SmtUtils]: Spent 9.24s 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:42:16,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1671837310, now seen corresponding path program 2 times [2022-04-15 11:42:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:16,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044445069] [2022-04-15 11:42:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:17,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {95656#(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); {95649#true} is VALID [2022-04-15 11:42:17,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {95649#true} assume true; {95649#true} is VALID [2022-04-15 11:42:17,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95649#true} {95649#true} #593#return; {95649#true} is VALID [2022-04-15 11:42:17,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {95649#true} call ULTIMATE.init(); {95656#(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:42:17,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {95656#(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); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {95649#true} assume true; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95649#true} {95649#true} #593#return; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {95649#true} call #t~ret158 := main(); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {95649#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {95649#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {95649#true} assume 12292 == #t~mem49;havoc #t~mem49; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {95649#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {95649#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {95649#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {95649#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {95649#true} assume !(0 == ~tmp___4~0); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {95649#true} assume 4368 == #t~mem54;havoc #t~mem54; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {95649#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {95649#true} assume 4384 == #t~mem56;havoc #t~mem56; {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {95649#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 51: Hoare triple {95649#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 52: Hoare triple {95649#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 53: Hoare triple {95649#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {95649#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 60: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 61: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 62: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 63: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 64: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 65: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {95649#true} assume 4400 == #t~mem58;havoc #t~mem58; {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 71: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 72: Hoare triple {95649#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {95649#true} is VALID [2022-04-15 11:42:17,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {95649#true} assume !(~ret~0 <= 0); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {95649#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 76: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 77: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 78: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 79: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 81: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 82: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 83: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 84: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 85: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 86: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 87: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 88: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 89: Hoare triple {95649#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 90: Hoare triple {95649#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 91: Hoare triple {95649#true} assume 4416 == #t~mem60;havoc #t~mem60; {95649#true} is VALID [2022-04-15 11:42:17,020 INFO L290 TraceCheckUtils]: 92: Hoare triple {95649#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 93: Hoare triple {95649#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 94: Hoare triple {95649#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 95: Hoare triple {95649#true} assume !(0 == ~tmp___6~0); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 96: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 97: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 98: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 99: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 100: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 101: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 103: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 104: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 105: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 106: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 107: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 108: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 109: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 110: Hoare triple {95649#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,021 INFO L290 TraceCheckUtils]: 111: Hoare triple {95649#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 112: Hoare triple {95649#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 113: Hoare triple {95649#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 114: Hoare triple {95649#true} assume 4432 == #t~mem62;havoc #t~mem62; {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 115: Hoare triple {95649#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 116: Hoare triple {95649#true} assume !(5 == ~blastFlag~0); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 117: Hoare triple {95649#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 118: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 119: Hoare triple {95649#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 120: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 121: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 122: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 123: Hoare triple {95649#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 124: Hoare triple {95649#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 125: Hoare triple {95649#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 126: Hoare triple {95649#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 127: Hoare triple {95649#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 128: Hoare triple {95649#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,022 INFO L290 TraceCheckUtils]: 129: Hoare triple {95649#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 130: Hoare triple {95649#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 131: Hoare triple {95649#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 132: Hoare triple {95649#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 133: Hoare triple {95649#true} assume 4401 == #t~mem59;havoc #t~mem59; {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 134: Hoare triple {95649#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); {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 135: Hoare triple {95649#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; {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 136: Hoare triple {95649#true} assume !(2 == ~blastFlag~0); {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 137: Hoare triple {95649#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {95649#true} is VALID [2022-04-15 11:42:17,023 INFO L290 TraceCheckUtils]: 138: Hoare triple {95649#true} assume !(~ret~0 <= 0); {95649#true} is VALID [2022-04-15 11:42:17,024 INFO L290 TraceCheckUtils]: 139: Hoare triple {95649#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,024 INFO L290 TraceCheckUtils]: 140: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,025 INFO L290 TraceCheckUtils]: 141: Hoare triple {95654#(= 4416 (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; {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,025 INFO L290 TraceCheckUtils]: 142: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,025 INFO L290 TraceCheckUtils]: 143: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,025 INFO L290 TraceCheckUtils]: 144: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,026 INFO L290 TraceCheckUtils]: 145: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,026 INFO L290 TraceCheckUtils]: 146: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,026 INFO L290 TraceCheckUtils]: 147: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,027 INFO L290 TraceCheckUtils]: 148: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,027 INFO L290 TraceCheckUtils]: 149: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,027 INFO L290 TraceCheckUtils]: 150: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,027 INFO L290 TraceCheckUtils]: 151: Hoare triple {95654#(= 4416 (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); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,028 INFO L290 TraceCheckUtils]: 152: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,028 INFO L290 TraceCheckUtils]: 153: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,028 INFO L290 TraceCheckUtils]: 154: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 155: Hoare triple {95654#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {95655#(= |ssl3_connect_#t~mem60| 4416)} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 156: Hoare triple {95655#(= |ssl3_connect_#t~mem60| 4416)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {95650#false} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 157: Hoare triple {95650#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {95650#false} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 158: Hoare triple {95650#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {95650#false} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 159: Hoare triple {95650#false} assume 4433 == #t~mem63;havoc #t~mem63; {95650#false} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 160: Hoare triple {95650#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {95650#false} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 161: Hoare triple {95650#false} assume 5 == ~blastFlag~0; {95650#false} is VALID [2022-04-15 11:42:17,029 INFO L290 TraceCheckUtils]: 162: Hoare triple {95650#false} assume !false; {95650#false} is VALID [2022-04-15 11:42:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 11:42:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:17,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044445069] [2022-04-15 11:42:17,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044445069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:17,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:17,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:17,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:17,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702083084] [2022-04-15 11:42:17,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702083084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:17,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:17,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096396437] [2022-04-15 11:42:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:17,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 163 [2022-04-15 11:42:17,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:17,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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:42:17,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:17,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:17,096 INFO L87 Difference]: Start difference. First operand 1036 states and 1518 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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:42:19,117 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:42:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:20,767 INFO L93 Difference]: Finished difference Result 2287 states and 3332 transitions. [2022-04-15 11:42:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:20,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 163 [2022-04-15 11:42:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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:42:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2022-04-15 11:42:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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:42:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2022-04-15 11:42:20,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 401 transitions. [2022-04-15 11:42:21,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:21,127 INFO L225 Difference]: With dead ends: 2287 [2022-04-15 11:42:21,127 INFO L226 Difference]: Without dead ends: 1267 [2022-04-15 11:42:21,128 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:42:21,128 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 40 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:21,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 506 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:42:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-04-15 11:42:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1146. [2022-04-15 11:42:21,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:21,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1267 states. Second operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 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:42:21,522 INFO L74 IsIncluded]: Start isIncluded. First operand 1267 states. Second operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 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:42:21,523 INFO L87 Difference]: Start difference. First operand 1267 states. Second operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 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:42:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:21,563 INFO L93 Difference]: Finished difference Result 1267 states and 1829 transitions. [2022-04-15 11:42:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1829 transitions. [2022-04-15 11:42:21,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:21,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:21,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 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 1267 states. [2022-04-15 11:42:21,567 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 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 1267 states. [2022-04-15 11:42:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:21,608 INFO L93 Difference]: Finished difference Result 1267 states and 1829 transitions. [2022-04-15 11:42:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1829 transitions. [2022-04-15 11:42:21,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:21,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:21,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:21,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4715162138475022) internal successors, (1679), 1141 states have internal predecessors, (1679), 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:42:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1683 transitions. [2022-04-15 11:42:21,671 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1683 transitions. Word has length 163 [2022-04-15 11:42:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:21,671 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1683 transitions. [2022-04-15 11:42:21,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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:42:21,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1683 transitions. [2022-04-15 11:42:23,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1683 edges. 1683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1683 transitions. [2022-04-15 11:42:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-15 11:42:23,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:23,236 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:23,237 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:42:23,237 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:23,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:23,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1665276355, now seen corresponding path program 1 times [2022-04-15 11:42:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:23,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1388448463] [2022-04-15 11:42:36,645 WARN L232 SmtUtils]: Spent 12.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:42:50,571 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1665276355, now seen corresponding path program 2 times [2022-04-15 11:42:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978672478] [2022-04-15 11:42:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:50,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:50,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {105070#(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); {105061#true} is VALID [2022-04-15 11:42:50,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-15 11:42:50,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105070#(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:42:50,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {105070#(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); {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {105061#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {105061#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {105061#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {105061#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {105061#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {105061#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 66: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 68: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 71: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-15 11:42:50,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:42:50,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:42:50,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:42:50,804 INFO L290 TraceCheckUtils]: 79: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,804 INFO L290 TraceCheckUtils]: 80: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,804 INFO L290 TraceCheckUtils]: 81: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105066#(= |ssl3_connect_#t~mem51| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:42:50,805 INFO L290 TraceCheckUtils]: 82: Hoare triple {105066#(= |ssl3_connect_#t~mem51| (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,806 INFO L290 TraceCheckUtils]: 85: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,807 INFO L290 TraceCheckUtils]: 87: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,807 INFO L290 TraceCheckUtils]: 88: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 90: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105068#(not (= |ssl3_connect_#t~mem60| 4096))} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 91: Hoare triple {105068#(not (= |ssl3_connect_#t~mem60| 4096))} assume 4416 == #t~mem60;havoc #t~mem60; {105061#true} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 92: Hoare triple {105061#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105061#true} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 94: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 96: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:42:50,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 100: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 101: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 102: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 103: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 104: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 105: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 106: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 107: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 108: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 109: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,809 INFO L290 TraceCheckUtils]: 110: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 111: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 112: Hoare triple {105061#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 113: Hoare triple {105061#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 115: Hoare triple {105061#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 117: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 118: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 119: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:42:50,810 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 122: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 123: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 124: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 125: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 126: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 127: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 128: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 129: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 130: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 131: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 132: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:42:50,811 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-15 11:42:50,812 INFO L290 TraceCheckUtils]: 134: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:42:50,812 INFO L290 TraceCheckUtils]: 135: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:42:50,812 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-15 11:42:50,812 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-15 11:42:50,812 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-15 11:42:50,813 INFO L290 TraceCheckUtils]: 139: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,813 INFO L290 TraceCheckUtils]: 140: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,814 INFO L290 TraceCheckUtils]: 141: Hoare triple {105067#(not (= 4096 (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; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,814 INFO L290 TraceCheckUtils]: 142: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,815 INFO L290 TraceCheckUtils]: 143: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,815 INFO L290 TraceCheckUtils]: 144: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,815 INFO L290 TraceCheckUtils]: 145: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:42:50,816 INFO L290 TraceCheckUtils]: 146: Hoare triple {105067#(not (= 4096 (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); {105069#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-15 11:42:50,816 INFO L290 TraceCheckUtils]: 147: Hoare triple {105069#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {105062#false} is VALID [2022-04-15 11:42:50,816 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,816 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-15 11:42:50,816 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 151: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 152: Hoare triple {105062#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 154: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 155: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 156: Hoare triple {105062#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 159: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 160: Hoare triple {105062#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 161: Hoare triple {105062#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,817 INFO L290 TraceCheckUtils]: 162: Hoare triple {105062#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 163: Hoare triple {105062#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 164: Hoare triple {105062#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 165: Hoare triple {105062#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 166: Hoare triple {105062#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 167: Hoare triple {105062#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 168: Hoare triple {105062#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 169: Hoare triple {105062#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 170: Hoare triple {105062#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 171: Hoare triple {105062#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 172: Hoare triple {105062#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 173: Hoare triple {105062#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:42:50,818 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-15 11:42:50,819 INFO L290 TraceCheckUtils]: 175: Hoare triple {105062#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105062#false} is VALID [2022-04-15 11:42:50,819 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-15 11:42:50,819 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-15 11:42:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 179 proven. 20 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-04-15 11:42:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:50,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978672478] [2022-04-15 11:42:50,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978672478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:42:50,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862825348] [2022-04-15 11:42:50,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:42:50,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:42:50,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:42:50,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:42:50,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 11:43:28,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:43:28,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:43:28,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 11:43:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:28,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:43:29,037 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:43:29,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 11:43:29,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 11:43:29,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:43:29,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:43:29,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2022-04-15 11:43:29,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:43:29,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:43:29,214 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:43:29,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:43:29,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-04-15 11:43:29,428 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:43:29,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-15 11:43:29,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:43:29,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105061#true} is VALID [2022-04-15 11:43:29,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {105061#true} #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); {105061#true} is VALID [2022-04-15 11:43:29,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {105061#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {105061#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {105061#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105061#true} is VALID [2022-04-15 11:43:29,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-15 11:43:29,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {105061#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); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {105137#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 47: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {105061#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {105061#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {105061#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 55: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 61: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 68: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 74: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 76: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,529 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,530 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,530 INFO L290 TraceCheckUtils]: 79: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,530 INFO L290 TraceCheckUtils]: 80: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,530 INFO L290 TraceCheckUtils]: 81: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105066#(= |ssl3_connect_#t~mem51| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,530 INFO L290 TraceCheckUtils]: 82: Hoare triple {105066#(= |ssl3_connect_#t~mem51| (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,531 INFO L290 TraceCheckUtils]: 83: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,531 INFO L290 TraceCheckUtils]: 84: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,531 INFO L290 TraceCheckUtils]: 85: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,532 INFO L290 TraceCheckUtils]: 86: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,532 INFO L290 TraceCheckUtils]: 87: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,532 INFO L290 TraceCheckUtils]: 88: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,532 INFO L290 TraceCheckUtils]: 89: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 90: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105068#(not (= |ssl3_connect_#t~mem60| 4096))} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 91: Hoare triple {105068#(not (= |ssl3_connect_#t~mem60| 4096))} assume 4416 == #t~mem60;havoc #t~mem60; {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 92: Hoare triple {105061#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 94: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 96: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 97: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 100: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,533 INFO L290 TraceCheckUtils]: 101: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 102: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 106: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 107: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 108: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 109: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 110: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 111: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 112: Hoare triple {105061#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 113: Hoare triple {105061#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 115: Hoare triple {105061#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 117: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 118: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 119: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,534 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 122: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 123: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 124: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 125: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 126: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 127: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 128: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 129: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 130: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 131: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 132: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 134: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 135: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-15 11:43:29,535 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-15 11:43:29,536 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-15 11:43:29,540 INFO L290 TraceCheckUtils]: 139: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,541 INFO L290 TraceCheckUtils]: 140: Hoare triple {105492#(= 4416 (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); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,541 INFO L290 TraceCheckUtils]: 141: Hoare triple {105492#(= 4416 (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; {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,541 INFO L290 TraceCheckUtils]: 142: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,542 INFO L290 TraceCheckUtils]: 143: Hoare triple {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,542 INFO L290 TraceCheckUtils]: 144: Hoare triple {105492#(= 4416 (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); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,542 INFO L290 TraceCheckUtils]: 145: Hoare triple {105492#(= 4416 (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); {105492#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 146: Hoare triple {105492#(= 4416 (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); {105514#(= |ssl3_connect_#t~mem51| 4416)} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 147: Hoare triple {105514#(= |ssl3_connect_#t~mem51| 4416)} assume 4096 == #t~mem51;havoc #t~mem51; {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 151: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 152: Hoare triple {105062#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 154: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 155: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,543 INFO L290 TraceCheckUtils]: 156: Hoare triple {105062#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 159: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 160: Hoare triple {105062#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 161: Hoare triple {105062#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 162: Hoare triple {105062#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 163: Hoare triple {105062#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 164: Hoare triple {105062#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 165: Hoare triple {105062#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 166: Hoare triple {105062#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 167: Hoare triple {105062#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 168: Hoare triple {105062#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 169: Hoare triple {105062#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 170: Hoare triple {105062#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 171: Hoare triple {105062#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 172: Hoare triple {105062#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 173: Hoare triple {105062#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,544 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-15 11:43:29,545 INFO L290 TraceCheckUtils]: 175: Hoare triple {105062#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105062#false} is VALID [2022-04-15 11:43:29,545 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-15 11:43:29,545 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-15 11:43:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 171 proven. 78 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-04-15 11:43:29,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 175: Hoare triple {105062#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 173: Hoare triple {105062#false} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 172: Hoare triple {105062#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 171: Hoare triple {105062#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 170: Hoare triple {105062#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 169: Hoare triple {105062#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 168: Hoare triple {105062#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 167: Hoare triple {105062#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,787 INFO L290 TraceCheckUtils]: 166: Hoare triple {105062#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 165: Hoare triple {105062#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 164: Hoare triple {105062#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 163: Hoare triple {105062#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 162: Hoare triple {105062#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 161: Hoare triple {105062#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 160: Hoare triple {105062#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 159: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 156: Hoare triple {105062#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 155: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 154: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 152: Hoare triple {105062#false} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 151: Hoare triple {105062#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); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-15 11:43:29,788 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-15 11:43:29,789 INFO L290 TraceCheckUtils]: 147: Hoare triple {105069#(not (= |ssl3_connect_#t~mem51| 4096))} assume 4096 == #t~mem51;havoc #t~mem51; {105062#false} is VALID [2022-04-15 11:43:29,790 INFO L290 TraceCheckUtils]: 146: Hoare triple {105067#(not (= 4096 (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); {105069#(not (= |ssl3_connect_#t~mem51| 4096))} is VALID [2022-04-15 11:43:29,790 INFO L290 TraceCheckUtils]: 145: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,790 INFO L290 TraceCheckUtils]: 144: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,790 INFO L290 TraceCheckUtils]: 143: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,791 INFO L290 TraceCheckUtils]: 142: Hoare triple {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,791 INFO L290 TraceCheckUtils]: 141: Hoare triple {105067#(not (= 4096 (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; {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,791 INFO L290 TraceCheckUtils]: 140: Hoare triple {105067#(not (= 4096 (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); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,792 INFO L290 TraceCheckUtils]: 139: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105067#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:43:29,792 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-15 11:43:29,792 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-15 11:43:29,792 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-15 11:43:29,792 INFO L290 TraceCheckUtils]: 135: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 134: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 132: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 131: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 130: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 129: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 128: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 127: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 126: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 125: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 124: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 123: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 122: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,793 INFO L290 TraceCheckUtils]: 119: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 118: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 117: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 115: Hoare triple {105061#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 113: Hoare triple {105061#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 112: Hoare triple {105061#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 111: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 110: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 109: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 108: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 107: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 106: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 105: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 104: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 103: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,794 INFO L290 TraceCheckUtils]: 102: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 101: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 100: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 97: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 94: Hoare triple {105061#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 92: Hoare triple {105061#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 91: Hoare triple {105061#true} assume 4416 == #t~mem60;havoc #t~mem60; {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {105061#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {105061#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 87: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 84: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 83: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 82: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 75: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 74: Hoare triple {105061#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 71: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 70: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,796 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 68: Hoare triple {105061#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {105061#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 59: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 55: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,797 INFO L290 TraceCheckUtils]: 53: Hoare triple {105061#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {105061#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {105061#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {105061#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {105061#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {105061#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {105061#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {105061#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {105061#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {105061#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {105061#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-15 11:43:29,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {105061#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {105061#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {105061#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); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {105061#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {105061#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; {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-15 11:43:29,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-15 11:43:29,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-15 11:43:29,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {105061#true} #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); {105061#true} is VALID [2022-04-15 11:43:29,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105061#true} is VALID [2022-04-15 11:43:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 11:43:29,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862825348] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:43:29,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:43:29,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-15 11:43:29,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:29,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1388448463] [2022-04-15 11:43:29,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1388448463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:29,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:29,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:43:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819378056] [2022-04-15 11:43:29,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:29,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 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 178 [2022-04-15 11:43:29,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:29,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 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:43:29,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:29,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:43:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:29,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:43:29,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:43:29,876 INFO L87 Difference]: Start difference. First operand 1146 states and 1683 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 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:43:33,918 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:43:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:37,405 INFO L93 Difference]: Finished difference Result 2580 states and 3790 transitions. [2022-04-15 11:43:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:43:37,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 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 178 [2022-04-15 11:43:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 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:43:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-04-15 11:43:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 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:43:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-04-15 11:43:37,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 461 transitions. [2022-04-15 11:43:37,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:37,768 INFO L225 Difference]: With dead ends: 2580 [2022-04-15 11:43:37,768 INFO L226 Difference]: Without dead ends: 1450 [2022-04-15 11:43:37,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:43:37,770 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 109 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:37,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 292 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 200 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:43:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-04-15 11:43:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1146. [2022-04-15 11:43:38,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:38,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1450 states. Second operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 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:43:38,135 INFO L74 IsIncluded]: Start isIncluded. First operand 1450 states. Second operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 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:43:38,136 INFO L87 Difference]: Start difference. First operand 1450 states. Second operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 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:43:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:38,188 INFO L93 Difference]: Finished difference Result 1450 states and 2107 transitions. [2022-04-15 11:43:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2022-04-15 11:43:38,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:38,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:38,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 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 1450 states. [2022-04-15 11:43:38,191 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 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 1450 states. [2022-04-15 11:43:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:38,247 INFO L93 Difference]: Finished difference Result 1450 states and 2107 transitions. [2022-04-15 11:43:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2022-04-15 11:43:38,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:38,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:38,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:38,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4539877300613497) internal successors, (1659), 1141 states have internal predecessors, (1659), 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:43:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1663 transitions. [2022-04-15 11:43:38,299 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1663 transitions. Word has length 178 [2022-04-15 11:43:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:38,300 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1663 transitions. [2022-04-15 11:43:38,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 1 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:43:38,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1663 transitions. [2022-04-15 11:43:39,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1663 edges. 1663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1663 transitions. [2022-04-15 11:43:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-15 11:43:39,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:39,809 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:39,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 11:43:40,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 11:43:40,010 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash -543824043, now seen corresponding path program 1 times [2022-04-15 11:43:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:40,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1074033171] [2022-04-15 11:43:55,697 WARN L232 SmtUtils]: Spent 11.45s 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:44:02,795 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -543824043, now seen corresponding path program 2 times [2022-04-15 11:44:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:02,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382017816] [2022-04-15 11:44:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:03,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {116504#(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); {116495#true} is VALID [2022-04-15 11:44:03,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-15 11:44:03,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116504#(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:44:03,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {116504#(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); {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {116495#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {116495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116495#true} is VALID [2022-04-15 11:44:03,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {116495#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 46: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {116495#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {116495#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {116495#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 55: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 56: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 67: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 70: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 71: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 74: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 75: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 76: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:03,009 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:03,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,018 INFO L290 TraceCheckUtils]: 80: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,018 INFO L290 TraceCheckUtils]: 81: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,018 INFO L290 TraceCheckUtils]: 82: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,018 INFO L290 TraceCheckUtils]: 83: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,018 INFO L290 TraceCheckUtils]: 84: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,018 INFO L290 TraceCheckUtils]: 85: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,019 INFO L290 TraceCheckUtils]: 86: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:03,019 INFO L290 TraceCheckUtils]: 87: Hoare triple {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,019 INFO L290 TraceCheckUtils]: 88: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 89: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 90: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116502#(not (= |ssl3_connect_#t~mem60| 4384))} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 91: Hoare triple {116502#(not (= |ssl3_connect_#t~mem60| 4384))} assume 4416 == #t~mem60;havoc #t~mem60; {116495#true} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 92: Hoare triple {116495#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116495#true} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 94: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-15 11:44:03,020 INFO L290 TraceCheckUtils]: 96: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 97: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 100: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 101: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 103: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 104: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 105: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 106: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 107: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 108: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 109: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 110: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 111: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 112: Hoare triple {116495#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 113: Hoare triple {116495#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-15 11:44:03,021 INFO L290 TraceCheckUtils]: 115: Hoare triple {116495#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 117: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 118: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 119: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 122: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 123: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 124: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 125: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 126: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 127: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 128: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 129: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 130: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 131: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 132: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:03,022 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-15 11:44:03,023 INFO L290 TraceCheckUtils]: 134: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:03,023 INFO L290 TraceCheckUtils]: 135: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:03,023 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-15 11:44:03,023 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-15 11:44:03,023 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-15 11:44:03,024 INFO L290 TraceCheckUtils]: 139: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,024 INFO L290 TraceCheckUtils]: 140: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,024 INFO L290 TraceCheckUtils]: 141: Hoare triple {116501#(not (= 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; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,025 INFO L290 TraceCheckUtils]: 142: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,025 INFO L290 TraceCheckUtils]: 143: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,025 INFO L290 TraceCheckUtils]: 144: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,025 INFO L290 TraceCheckUtils]: 145: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,026 INFO L290 TraceCheckUtils]: 146: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,026 INFO L290 TraceCheckUtils]: 147: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,026 INFO L290 TraceCheckUtils]: 148: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,027 INFO L290 TraceCheckUtils]: 149: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,027 INFO L290 TraceCheckUtils]: 150: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:03,027 INFO L290 TraceCheckUtils]: 151: Hoare triple {116501#(not (= 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); {116503#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-15 11:44:03,027 INFO L290 TraceCheckUtils]: 152: Hoare triple {116503#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 153: Hoare triple {116496#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 155: Hoare triple {116496#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 156: Hoare triple {116496#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 158: Hoare triple {116496#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); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 159: Hoare triple {116496#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 162: Hoare triple {116496#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); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 163: Hoare triple {116496#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 164: Hoare triple {116496#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 165: Hoare triple {116496#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 166: Hoare triple {116496#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 167: Hoare triple {116496#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 168: Hoare triple {116496#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 169: Hoare triple {116496#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,028 INFO L290 TraceCheckUtils]: 170: Hoare triple {116496#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 171: Hoare triple {116496#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 172: Hoare triple {116496#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 173: Hoare triple {116496#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 174: Hoare triple {116496#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 175: Hoare triple {116496#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 177: Hoare triple {116496#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-15 11:44:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 196 proven. 10 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-04-15 11:44:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382017816] [2022-04-15 11:44:03,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382017816] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:44:03,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768549336] [2022-04-15 11:44:03,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:44:03,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:44:03,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:44:03,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:44:03,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 11:44:47,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:44:47,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:44:47,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 11:44:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:47,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:44:47,297 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:44:47,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 11:44:47,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 11:44:47,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:44:47,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:44:47,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-15 11:44:47,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-04-15 11:44:47,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:44:47,482 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:44:47,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:44:47,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-04-15 11:44:47,689 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:44:47,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-15 11:44:47,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:44:47,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {116495#true} #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); {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {116495#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {116495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-15 11:44:47,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-15 11:44:47,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {116495#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {116495#true} is VALID [2022-04-15 11:44:47,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-15 11:44:47,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {116495#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); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {116571#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-15 11:44:47,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-15 11:44:47,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {116495#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {116495#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {116495#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 56: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 59: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 61: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,809 INFO L290 TraceCheckUtils]: 71: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 74: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 75: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 79: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 81: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,811 INFO L290 TraceCheckUtils]: 86: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,811 INFO L290 TraceCheckUtils]: 87: Hoare triple {116500#(= |ssl3_connect_#t~mem56| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:47,811 INFO L290 TraceCheckUtils]: 88: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 89: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 90: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116502#(not (= |ssl3_connect_#t~mem60| 4384))} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 91: Hoare triple {116502#(not (= |ssl3_connect_#t~mem60| 4384))} assume 4416 == #t~mem60;havoc #t~mem60; {116495#true} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 92: Hoare triple {116495#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116495#true} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 94: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 96: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,812 INFO L290 TraceCheckUtils]: 97: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 100: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 101: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 102: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 103: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 104: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 105: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 106: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 107: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 108: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 109: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 110: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 111: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 112: Hoare triple {116495#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 113: Hoare triple {116495#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-15 11:44:47,813 INFO L290 TraceCheckUtils]: 115: Hoare triple {116495#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 117: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 118: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 119: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 122: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 123: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 124: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 125: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 126: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 127: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 128: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 129: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 130: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 131: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 132: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:47,814 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-15 11:44:47,815 INFO L290 TraceCheckUtils]: 134: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:47,815 INFO L290 TraceCheckUtils]: 135: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:47,815 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-15 11:44:47,815 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-15 11:44:47,815 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-15 11:44:47,816 INFO L290 TraceCheckUtils]: 139: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,816 INFO L290 TraceCheckUtils]: 140: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,816 INFO L290 TraceCheckUtils]: 141: Hoare triple {116926#(= 4416 (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; {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,817 INFO L290 TraceCheckUtils]: 142: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,817 INFO L290 TraceCheckUtils]: 143: Hoare triple {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,818 INFO L290 TraceCheckUtils]: 144: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,818 INFO L290 TraceCheckUtils]: 145: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,818 INFO L290 TraceCheckUtils]: 146: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,819 INFO L290 TraceCheckUtils]: 147: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,819 INFO L290 TraceCheckUtils]: 148: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,819 INFO L290 TraceCheckUtils]: 149: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,820 INFO L290 TraceCheckUtils]: 150: Hoare triple {116926#(= 4416 (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); {116926#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:44:47,820 INFO L290 TraceCheckUtils]: 151: Hoare triple {116926#(= 4416 (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); {116963#(= |ssl3_connect_#t~mem56| 4416)} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 152: Hoare triple {116963#(= |ssl3_connect_#t~mem56| 4416)} assume 4384 == #t~mem56;havoc #t~mem56; {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 153: Hoare triple {116496#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 155: Hoare triple {116496#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 156: Hoare triple {116496#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 158: Hoare triple {116496#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); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 159: Hoare triple {116496#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 162: Hoare triple {116496#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); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 163: Hoare triple {116496#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 164: Hoare triple {116496#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 165: Hoare triple {116496#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 166: Hoare triple {116496#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,821 INFO L290 TraceCheckUtils]: 167: Hoare triple {116496#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 168: Hoare triple {116496#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 169: Hoare triple {116496#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 170: Hoare triple {116496#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 171: Hoare triple {116496#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 172: Hoare triple {116496#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 173: Hoare triple {116496#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 174: Hoare triple {116496#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 175: Hoare triple {116496#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 177: Hoare triple {116496#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-15 11:44:47,822 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-15 11:44:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 189 proven. 70 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-04-15 11:44:47,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:44:48,100 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 177: Hoare triple {116496#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 175: Hoare triple {116496#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 174: Hoare triple {116496#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 173: Hoare triple {116496#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 172: Hoare triple {116496#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 171: Hoare triple {116496#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 170: Hoare triple {116496#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 169: Hoare triple {116496#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 168: Hoare triple {116496#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 167: Hoare triple {116496#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 166: Hoare triple {116496#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 165: Hoare triple {116496#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 164: Hoare triple {116496#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,101 INFO L290 TraceCheckUtils]: 163: Hoare triple {116496#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 162: Hoare triple {116496#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); {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 159: Hoare triple {116496#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 158: Hoare triple {116496#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); {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 156: Hoare triple {116496#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 155: Hoare triple {116496#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 153: Hoare triple {116496#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116496#false} is VALID [2022-04-15 11:44:48,102 INFO L290 TraceCheckUtils]: 152: Hoare triple {116503#(not (= |ssl3_connect_#t~mem56| 4384))} assume 4384 == #t~mem56;havoc #t~mem56; {116496#false} is VALID [2022-04-15 11:44:48,103 INFO L290 TraceCheckUtils]: 151: Hoare triple {116501#(not (= 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); {116503#(not (= |ssl3_connect_#t~mem56| 4384))} is VALID [2022-04-15 11:44:48,103 INFO L290 TraceCheckUtils]: 150: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,103 INFO L290 TraceCheckUtils]: 149: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,104 INFO L290 TraceCheckUtils]: 148: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,104 INFO L290 TraceCheckUtils]: 147: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,104 INFO L290 TraceCheckUtils]: 146: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,105 INFO L290 TraceCheckUtils]: 145: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,105 INFO L290 TraceCheckUtils]: 144: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,105 INFO L290 TraceCheckUtils]: 143: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,106 INFO L290 TraceCheckUtils]: 142: Hoare triple {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,106 INFO L290 TraceCheckUtils]: 141: Hoare triple {116501#(not (= 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; {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,106 INFO L290 TraceCheckUtils]: 140: Hoare triple {116501#(not (= 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); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 139: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116501#(not (= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 135: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 134: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 132: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,107 INFO L290 TraceCheckUtils]: 131: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 130: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 129: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 128: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 127: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 126: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 125: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 124: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 123: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 122: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 119: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 118: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 117: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 115: Hoare triple {116495#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {116495#true} is VALID [2022-04-15 11:44:48,108 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 113: Hoare triple {116495#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 112: Hoare triple {116495#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 111: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 110: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 109: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 108: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 107: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 106: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 105: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 104: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 103: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 102: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 101: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 100: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 97: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:48,109 INFO L290 TraceCheckUtils]: 96: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {116495#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 92: Hoare triple {116495#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {116495#true} assume 4416 == #t~mem60;havoc #t~mem60; {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {116495#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {116495#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 86: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 84: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 83: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 82: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 79: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,110 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 76: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 75: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 74: Hoare triple {116495#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 68: Hoare triple {116495#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 67: Hoare triple {116495#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 63: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {116495#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {116495#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {116495#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {116495#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {116495#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {116495#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {116495#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {116495#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {116495#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {116495#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {116495#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {116495#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {116495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {116495#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); {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {116495#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {116495#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; {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {116495#true} #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); {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116495#true} is VALID [2022-04-15 11:44:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 11:44:48,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768549336] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:44:48,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:44:48,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-15 11:44:48,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:48,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1074033171] [2022-04-15 11:44:48,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1074033171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:48,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:48,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:44:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444467837] [2022-04-15 11:44:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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 180 [2022-04-15 11:44:48,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:48,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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:44:48,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:48,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:44:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:44:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:44:48,189 INFO L87 Difference]: Start difference. First operand 1146 states and 1663 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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:44:52,231 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:44:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:55,658 INFO L93 Difference]: Finished difference Result 2625 states and 3805 transitions. [2022-04-15 11:44:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:44:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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 180 [2022-04-15 11:44:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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:44:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:44:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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:44:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:44:55,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-15 11:44:55,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:56,068 INFO L225 Difference]: With dead ends: 2625 [2022-04-15 11:44:56,069 INFO L226 Difference]: Without dead ends: 1495 [2022-04-15 11:44:56,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:44:56,070 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:56,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 288 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:44:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-04-15 11:44:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1146. [2022-04-15 11:44:56,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:56,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1495 states. Second operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 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:44:56,459 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 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:44:56,459 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 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:44:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:56,515 INFO L93 Difference]: Finished difference Result 1495 states and 2142 transitions. [2022-04-15 11:44:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2142 transitions. [2022-04-15 11:44:56,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:56,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:56,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 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 1495 states. [2022-04-15 11:44:56,518 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 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 1495 states. [2022-04-15 11:44:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:56,573 INFO L93 Difference]: Finished difference Result 1495 states and 2142 transitions. [2022-04-15 11:44:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2142 transitions. [2022-04-15 11:44:56,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:56,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:56,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:56,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4364592462751973) internal successors, (1639), 1141 states have internal predecessors, (1639), 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:44:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1643 transitions. [2022-04-15 11:44:56,627 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1643 transitions. Word has length 180 [2022-04-15 11:44:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:56,627 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1643 transitions. [2022-04-15 11:44:56,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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:44:56,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1643 transitions. [2022-04-15 11:44:58,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1643 edges. 1643 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1643 transitions. [2022-04-15 11:44:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-15 11:44:58,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:58,205 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:58,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 11:44:58,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:44:58,406 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash -684613610, now seen corresponding path program 1 times [2022-04-15 11:44:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:58,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1846852904] [2022-04-15 11:45:22,134 WARN L232 SmtUtils]: Spent 18.91s 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:45:29,861 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -684613610, now seen corresponding path program 2 times [2022-04-15 11:45:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98122364] [2022-04-15 11:45:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:30,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {128130#(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); {128121#true} is VALID [2022-04-15 11:45:30,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-15 11:45:30,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-15 11:45:30,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128130#(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:45:30,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {128130#(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); {128121#true} is VALID [2022-04-15 11:45:30,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {128121#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {128121#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {128121#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:45:30,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:45:30,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {128121#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {128121#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,088 INFO L290 TraceCheckUtils]: 53: Hoare triple {128121#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 55: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 59: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,089 INFO L290 TraceCheckUtils]: 65: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 67: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 68: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 70: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 71: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 75: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 79: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,090 INFO L290 TraceCheckUtils]: 81: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,091 INFO L290 TraceCheckUtils]: 82: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,091 INFO L290 TraceCheckUtils]: 83: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,091 INFO L290 TraceCheckUtils]: 84: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,091 INFO L290 TraceCheckUtils]: 87: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 90: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128128#(not (= |ssl3_connect_#t~mem60| 4385))} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 91: Hoare triple {128128#(not (= |ssl3_connect_#t~mem60| 4385))} assume 4416 == #t~mem60;havoc #t~mem60; {128121#true} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {128121#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {128121#true} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 94: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,092 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 96: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 97: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 100: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 101: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 102: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 103: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 106: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 107: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 108: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 109: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 110: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 111: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,093 INFO L290 TraceCheckUtils]: 112: Hoare triple {128121#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 113: Hoare triple {128121#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 115: Hoare triple {128121#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 117: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 118: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 119: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 122: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 123: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 124: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 125: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 126: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 127: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 128: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 129: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,094 INFO L290 TraceCheckUtils]: 130: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 131: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 132: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 134: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 135: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-15 11:45:30,095 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-15 11:45:30,096 INFO L290 TraceCheckUtils]: 139: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,096 INFO L290 TraceCheckUtils]: 140: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,096 INFO L290 TraceCheckUtils]: 141: Hoare triple {128127#(not (= 4385 (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; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,097 INFO L290 TraceCheckUtils]: 142: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,097 INFO L290 TraceCheckUtils]: 143: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,097 INFO L290 TraceCheckUtils]: 144: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,097 INFO L290 TraceCheckUtils]: 145: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,098 INFO L290 TraceCheckUtils]: 146: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,098 INFO L290 TraceCheckUtils]: 147: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,098 INFO L290 TraceCheckUtils]: 148: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,098 INFO L290 TraceCheckUtils]: 149: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,099 INFO L290 TraceCheckUtils]: 150: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,099 INFO L290 TraceCheckUtils]: 151: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:45:30,099 INFO L290 TraceCheckUtils]: 152: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128129#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 153: Hoare triple {128129#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 154: Hoare triple {128122#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 156: Hoare triple {128122#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 157: Hoare triple {128122#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 159: Hoare triple {128122#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); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 160: Hoare triple {128122#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 163: Hoare triple {128122#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); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 164: Hoare triple {128122#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 165: Hoare triple {128122#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 166: Hoare triple {128122#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,100 INFO L290 TraceCheckUtils]: 167: Hoare triple {128122#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 168: Hoare triple {128122#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 169: Hoare triple {128122#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 170: Hoare triple {128122#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 171: Hoare triple {128122#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 172: Hoare triple {128122#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 173: Hoare triple {128122#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 174: Hoare triple {128122#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 175: Hoare triple {128122#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 176: Hoare triple {128122#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 178: Hoare triple {128122#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-15 11:45:30,101 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-15 11:45:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 199 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-04-15 11:45:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98122364] [2022-04-15 11:45:30,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98122364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:45:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438126653] [2022-04-15 11:45:30,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:45:30,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:45:30,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:45:30,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:45:30,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 11:46:31,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:46:31,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:46:31,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 11:46:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:31,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:46:31,647 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-15 11:46:31,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 143 [2022-04-15 11:46:31,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 63 [2022-04-15 11:46:31,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:46:31,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-04-15 11:46:31,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2022-04-15 11:46:31,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-04-15 11:46:31,814 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-15 11:46:31,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:46:31,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-04-15 11:46:31,990 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-15 11:46:31,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-15 11:46:32,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 11:46:32,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128121#true} is VALID [2022-04-15 11:46:32,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {128121#true} #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); {128121#true} is VALID [2022-04-15 11:46:32,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-15 11:46:32,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-15 11:46:32,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-15 11:46:32,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {128121#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {128121#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {128121#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {128121#true} is VALID [2022-04-15 11:46:32,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-15 11:46:32,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {128121#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); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} ~skip~0 := 0; {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !false; {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 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); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {128197#(= 0 (select (select |#memory_int| ssl3_connect_~s.base) (+ 64 ssl3_connect_~s.offset)))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 48: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {128121#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {128121#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {128121#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 60: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 61: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 62: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 64: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 74: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 79: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 80: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,098 INFO L290 TraceCheckUtils]: 83: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,099 INFO L290 TraceCheckUtils]: 85: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,099 INFO L290 TraceCheckUtils]: 86: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,099 INFO L290 TraceCheckUtils]: 87: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,099 INFO L290 TraceCheckUtils]: 88: Hoare triple {128126#(= |ssl3_connect_#t~mem57| (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 89: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 90: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128128#(not (= |ssl3_connect_#t~mem60| 4385))} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 91: Hoare triple {128128#(not (= |ssl3_connect_#t~mem60| 4385))} assume 4416 == #t~mem60;havoc #t~mem60; {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 92: Hoare triple {128121#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 94: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 96: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 97: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 101: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 102: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 103: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 104: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 105: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 106: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 107: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 108: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 109: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 110: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 111: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 112: Hoare triple {128121#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 113: Hoare triple {128121#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 115: Hoare triple {128121#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-15 11:46:32,101 INFO L290 TraceCheckUtils]: 117: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 118: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 119: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 122: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 123: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 124: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 125: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 126: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 127: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 128: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 129: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 130: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 131: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 132: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-15 11:46:32,102 INFO L290 TraceCheckUtils]: 134: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,103 INFO L290 TraceCheckUtils]: 135: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,103 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-15 11:46:32,103 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-15 11:46:32,103 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-15 11:46:32,103 INFO L290 TraceCheckUtils]: 139: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,104 INFO L290 TraceCheckUtils]: 140: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,104 INFO L290 TraceCheckUtils]: 141: Hoare triple {128552#(= 4416 (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; {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,104 INFO L290 TraceCheckUtils]: 142: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,105 INFO L290 TraceCheckUtils]: 143: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,105 INFO L290 TraceCheckUtils]: 144: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,105 INFO L290 TraceCheckUtils]: 145: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,106 INFO L290 TraceCheckUtils]: 146: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,106 INFO L290 TraceCheckUtils]: 147: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,106 INFO L290 TraceCheckUtils]: 148: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,106 INFO L290 TraceCheckUtils]: 149: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,107 INFO L290 TraceCheckUtils]: 150: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,107 INFO L290 TraceCheckUtils]: 151: Hoare triple {128552#(= 4416 (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); {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:46:32,107 INFO L290 TraceCheckUtils]: 152: Hoare triple {128552#(= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128592#(= |ssl3_connect_#t~mem57| 4416)} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 153: Hoare triple {128592#(= |ssl3_connect_#t~mem57| 4416)} assume 4385 == #t~mem57;havoc #t~mem57; {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 154: Hoare triple {128122#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 156: Hoare triple {128122#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 157: Hoare triple {128122#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 159: Hoare triple {128122#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); {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 160: Hoare triple {128122#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 163: Hoare triple {128122#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); {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 164: Hoare triple {128122#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,108 INFO L290 TraceCheckUtils]: 165: Hoare triple {128122#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 166: Hoare triple {128122#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 167: Hoare triple {128122#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 168: Hoare triple {128122#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 169: Hoare triple {128122#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 170: Hoare triple {128122#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 171: Hoare triple {128122#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 172: Hoare triple {128122#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 173: Hoare triple {128122#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 174: Hoare triple {128122#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 175: Hoare triple {128122#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 176: Hoare triple {128122#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 178: Hoare triple {128122#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-15 11:46:32,109 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-15 11:46:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 192 proven. 68 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-15 11:46:32,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:46:32,401 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 178: Hoare triple {128122#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 176: Hoare triple {128122#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 175: Hoare triple {128122#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 174: Hoare triple {128122#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 173: Hoare triple {128122#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 172: Hoare triple {128122#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 171: Hoare triple {128122#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 170: Hoare triple {128122#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 169: Hoare triple {128122#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 168: Hoare triple {128122#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 167: Hoare triple {128122#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 166: Hoare triple {128122#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,402 INFO L290 TraceCheckUtils]: 165: Hoare triple {128122#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 164: Hoare triple {128122#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 163: Hoare triple {128122#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); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 160: Hoare triple {128122#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 159: Hoare triple {128122#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); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 157: Hoare triple {128122#false} assume 0 != #t~mem93;havoc #t~mem93;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 156: Hoare triple {128122#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-15 11:46:32,403 INFO L290 TraceCheckUtils]: 154: Hoare triple {128122#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128122#false} is VALID [2022-04-15 11:46:32,407 INFO L290 TraceCheckUtils]: 153: Hoare triple {128129#(not (= |ssl3_connect_#t~mem57| 4385))} assume 4385 == #t~mem57;havoc #t~mem57; {128122#false} is VALID [2022-04-15 11:46:32,407 INFO L290 TraceCheckUtils]: 152: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128129#(not (= |ssl3_connect_#t~mem57| 4385))} is VALID [2022-04-15 11:46:32,408 INFO L290 TraceCheckUtils]: 151: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,408 INFO L290 TraceCheckUtils]: 150: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,408 INFO L290 TraceCheckUtils]: 149: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,408 INFO L290 TraceCheckUtils]: 148: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,409 INFO L290 TraceCheckUtils]: 147: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,409 INFO L290 TraceCheckUtils]: 146: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,409 INFO L290 TraceCheckUtils]: 145: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,409 INFO L290 TraceCheckUtils]: 144: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,410 INFO L290 TraceCheckUtils]: 143: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,410 INFO L290 TraceCheckUtils]: 142: Hoare triple {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,410 INFO L290 TraceCheckUtils]: 141: Hoare triple {128127#(not (= 4385 (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; {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,411 INFO L290 TraceCheckUtils]: 140: Hoare triple {128127#(not (= 4385 (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); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,411 INFO L290 TraceCheckUtils]: 139: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128127#(not (= 4385 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 135: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 134: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 132: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 131: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 130: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 129: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 128: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 127: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 126: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 125: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 124: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,412 INFO L290 TraceCheckUtils]: 123: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 122: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 119: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 118: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 117: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 115: Hoare triple {128121#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {128121#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {128121#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 110: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 109: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 108: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 107: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,413 INFO L290 TraceCheckUtils]: 106: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 105: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 104: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 103: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 102: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 101: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 100: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 97: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 96: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 94: Hoare triple {128121#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 92: Hoare triple {128121#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 91: Hoare triple {128121#true} assume 4416 == #t~mem60;havoc #t~mem60; {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 90: Hoare triple {128121#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {128121#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,415 INFO L290 TraceCheckUtils]: 87: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 82: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 81: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 76: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 75: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 74: Hoare triple {128121#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-15 11:46:32,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 71: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {128121#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 67: Hoare triple {128121#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,419 INFO L290 TraceCheckUtils]: 59: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {128121#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {128121#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {128121#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128121#true} is VALID [2022-04-15 11:46:32,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {128121#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {128121#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-15 11:46:32,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {128121#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {128121#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {128121#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {128121#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {128121#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {128121#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-15 11:46:32,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {128121#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {128121#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {128121#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); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L272 TraceCheckUtils]: 6: Hoare triple {128121#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {128121#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; {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-15 11:46:32,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-15 11:46:32,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-15 11:46:32,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {128121#true} #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); {128121#true} is VALID [2022-04-15 11:46:32,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128121#true} is VALID [2022-04-15 11:46:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 11:46:32,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438126653] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:46:32,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:46:32,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-15 11:46:32,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:32,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1846852904] [2022-04-15 11:46:32,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1846852904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:32,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:32,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:46:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738569895] [2022-04-15 11:46:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 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 181 [2022-04-15 11:46:32,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:32,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 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:46:32,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:32,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:46:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:46:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:46:32,506 INFO L87 Difference]: Start difference. First operand 1146 states and 1643 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 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:46:38,571 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:46:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:39,995 INFO L93 Difference]: Finished difference Result 2621 states and 3760 transitions. [2022-04-15 11:46:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:46:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 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 181 [2022-04-15 11:46:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 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:46:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:46:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 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:46:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-15 11:46:39,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-15 11:46:40,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:40,382 INFO L225 Difference]: With dead ends: 2621 [2022-04-15 11:46:40,382 INFO L226 Difference]: Without dead ends: 1491 [2022-04-15 11:46:40,384 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:46:40,384 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 109 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:40,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 284 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:46:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2022-04-15 11:46:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1146. [2022-04-15 11:46:40,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:40,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1491 states. Second operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 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:46:40,763 INFO L74 IsIncluded]: Start isIncluded. First operand 1491 states. Second operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 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:46:40,764 INFO L87 Difference]: Start difference. First operand 1491 states. Second operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 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:46:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:40,819 INFO L93 Difference]: Finished difference Result 1491 states and 2117 transitions. [2022-04-15 11:46:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2117 transitions. [2022-04-15 11:46:40,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:40,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:40,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 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 1491 states. [2022-04-15 11:46:40,822 INFO L87 Difference]: Start difference. First operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 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 1491 states. [2022-04-15 11:46:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:40,883 INFO L93 Difference]: Finished difference Result 1491 states and 2117 transitions. [2022-04-15 11:46:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2117 transitions. [2022-04-15 11:46:40,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:40,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:40,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:40,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1141 states have (on average 1.4189307624890446) internal successors, (1619), 1141 states have internal predecessors, (1619), 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:46:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1623 transitions. [2022-04-15 11:46:40,939 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1623 transitions. Word has length 181 [2022-04-15 11:46:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:40,939 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1623 transitions. [2022-04-15 11:46:40,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 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:46:40,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1623 transitions. [2022-04-15 11:46:42,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1623 edges. 1623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1623 transitions. [2022-04-15 11:46:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-15 11:46:42,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:42,594 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:42,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 11:46:42,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:46:42,795 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1572475012, now seen corresponding path program 1 times [2022-04-15 11:46:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:42,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085400637] [2022-04-15 11:47:08,022 WARN L232 SmtUtils]: Spent 20.59s 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:47:16,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1572475012, now seen corresponding path program 2 times [2022-04-15 11:47:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:16,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957896698] [2022-04-15 11:47:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:16,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {139744#(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); {139737#true} is VALID [2022-04-15 11:47:16,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {139737#true} assume true; {139737#true} is VALID [2022-04-15 11:47:16,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139737#true} {139737#true} #593#return; {139737#true} is VALID [2022-04-15 11:47:16,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {139737#true} call ULTIMATE.init(); {139744#(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:47:16,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {139744#(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); {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {139737#true} assume true; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139737#true} {139737#true} #593#return; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {139737#true} call #t~ret158 := main(); {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {139737#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; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {139737#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {139737#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; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {139737#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; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {139737#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {139737#true} assume 12292 == #t~mem49;havoc #t~mem49; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {139737#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; {139737#true} is VALID [2022-04-15 11:47:16,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {139737#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {139737#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {139737#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {139737#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {139737#true} assume !(0 == ~tmp___4~0); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {139737#true} assume 4368 == #t~mem54;havoc #t~mem54; {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {139737#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; {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {139737#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {139737#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; {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 41: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 44: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {139737#true} assume 4384 == #t~mem56;havoc #t~mem56; {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {139737#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 51: Hoare triple {139737#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {139737#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {139737#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {139737#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 64: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {139737#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 68: Hoare triple {139737#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {139737#true} assume 4400 == #t~mem58;havoc #t~mem58; {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {139737#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; {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {139737#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {139737#true} assume !(~ret~0 <= 0); {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {139737#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 78: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-15 11:47:16,820 INFO L290 TraceCheckUtils]: 79: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 80: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 81: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 82: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 83: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 84: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 85: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 86: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 87: Hoare triple {139737#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 88: Hoare triple {139737#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 89: Hoare triple {139737#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 90: Hoare triple {139737#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 91: Hoare triple {139737#true} assume 4416 == #t~mem60;havoc #t~mem60; {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 92: Hoare triple {139737#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 93: Hoare triple {139737#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 94: Hoare triple {139737#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,821 INFO L290 TraceCheckUtils]: 95: Hoare triple {139737#true} assume !(0 == ~tmp___6~0); {139737#true} is VALID [2022-04-15 11:47:16,822 INFO L290 TraceCheckUtils]: 96: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,822 INFO L290 TraceCheckUtils]: 97: Hoare triple {139737#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139737#true} is VALID [2022-04-15 11:47:16,822 INFO L290 TraceCheckUtils]: 98: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-15 11:47:16,822 INFO L290 TraceCheckUtils]: 99: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-15 11:47:16,822 INFO L290 TraceCheckUtils]: 100: Hoare triple {139737#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); {139737#true} is VALID [2022-04-15 11:47:16,822 INFO L290 TraceCheckUtils]: 101: Hoare triple {139737#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,822 INFO L290 TraceCheckUtils]: 102: Hoare triple {139737#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 103: Hoare triple {139737#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 104: Hoare triple {139737#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 105: Hoare triple {139737#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 106: Hoare triple {139737#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 107: Hoare triple {139737#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 108: Hoare triple {139737#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 109: Hoare triple {139737#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 110: Hoare triple {139737#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 111: Hoare triple {139737#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 112: Hoare triple {139737#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {139737#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 114: Hoare triple {139737#true} assume 4432 == #t~mem62;havoc #t~mem62; {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 115: Hoare triple {139737#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {139737#true} is VALID [2022-04-15 11:47:16,823 INFO L290 TraceCheckUtils]: 116: Hoare triple {139737#true} assume !(5 == ~blastFlag~0); {139737#true} is VALID [2022-04-15 11:47:16,824 INFO L290 TraceCheckUtils]: 117: Hoare triple {139737#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,825 INFO L290 TraceCheckUtils]: 118: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,825 INFO L290 TraceCheckUtils]: 119: Hoare triple {139742#(= 4448 (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; {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,825 INFO L290 TraceCheckUtils]: 120: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,826 INFO L290 TraceCheckUtils]: 121: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,826 INFO L290 TraceCheckUtils]: 122: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,826 INFO L290 TraceCheckUtils]: 123: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,827 INFO L290 TraceCheckUtils]: 124: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,827 INFO L290 TraceCheckUtils]: 125: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,827 INFO L290 TraceCheckUtils]: 126: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,828 INFO L290 TraceCheckUtils]: 127: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,828 INFO L290 TraceCheckUtils]: 128: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,828 INFO L290 TraceCheckUtils]: 129: Hoare triple {139742#(= 4448 (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); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,828 INFO L290 TraceCheckUtils]: 130: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,829 INFO L290 TraceCheckUtils]: 131: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:16,829 INFO L290 TraceCheckUtils]: 132: Hoare triple {139742#(= 4448 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139743#(= |ssl3_connect_#t~mem59| 4448)} is VALID [2022-04-15 11:47:16,829 INFO L290 TraceCheckUtils]: 133: Hoare triple {139743#(= |ssl3_connect_#t~mem59| 4448)} assume 4401 == #t~mem59;havoc #t~mem59; {139738#false} is VALID [2022-04-15 11:47:16,829 INFO L290 TraceCheckUtils]: 134: Hoare triple {139738#false} 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); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 135: Hoare triple {139738#false} 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; {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 136: Hoare triple {139738#false} assume !(2 == ~blastFlag~0); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 137: Hoare triple {139738#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 138: Hoare triple {139738#false} assume !(~ret~0 <= 0); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 139: Hoare triple {139738#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 140: Hoare triple {139738#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); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 141: Hoare triple {139738#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 142: Hoare triple {139738#false} ~skip~0 := 0; {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 143: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 144: Hoare triple {139738#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); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 145: Hoare triple {139738#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 146: Hoare triple {139738#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 147: Hoare triple {139738#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 148: Hoare triple {139738#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 149: Hoare triple {139738#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 150: Hoare triple {139738#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,830 INFO L290 TraceCheckUtils]: 151: Hoare triple {139738#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 152: Hoare triple {139738#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 153: Hoare triple {139738#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 154: Hoare triple {139738#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 155: Hoare triple {139738#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 156: Hoare triple {139738#false} assume 4416 == #t~mem60;havoc #t~mem60; {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 157: Hoare triple {139738#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 158: Hoare triple {139738#false} assume !(3 == ~blastFlag~0); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 159: Hoare triple {139738#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 160: Hoare triple {139738#false} assume !(0 == ~tmp___6~0); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 161: Hoare triple {139738#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); {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 162: Hoare triple {139738#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 163: Hoare triple {139738#false} ~skip~0 := 0; {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 164: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-15 11:47:16,831 INFO L290 TraceCheckUtils]: 165: Hoare triple {139738#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); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 166: Hoare triple {139738#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 167: Hoare triple {139738#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 168: Hoare triple {139738#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 169: Hoare triple {139738#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 170: Hoare triple {139738#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 171: Hoare triple {139738#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 172: Hoare triple {139738#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 173: Hoare triple {139738#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 174: Hoare triple {139738#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 175: Hoare triple {139738#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 176: Hoare triple {139738#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 177: Hoare triple {139738#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 178: Hoare triple {139738#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 179: Hoare triple {139738#false} assume 4432 == #t~mem62;havoc #t~mem62; {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 180: Hoare triple {139738#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {139738#false} is VALID [2022-04-15 11:47:16,832 INFO L290 TraceCheckUtils]: 181: Hoare triple {139738#false} assume 5 == ~blastFlag~0; {139738#false} is VALID [2022-04-15 11:47:16,833 INFO L290 TraceCheckUtils]: 182: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-15 11:47:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-15 11:47:16,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957896698] [2022-04-15 11:47:16,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957896698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:16,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:16,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:16,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085400637] [2022-04-15 11:47:16,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085400637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:16,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:16,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:16,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580543753] [2022-04-15 11:47:16,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:16,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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 183 [2022-04-15 11:47:16,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:16,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:47:16,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:16,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:16,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:16,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:16,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:16,927 INFO L87 Difference]: Start difference. First operand 1146 states and 1623 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:47:18,946 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:47:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:20,857 INFO L93 Difference]: Finished difference Result 2632 states and 3744 transitions. [2022-04-15 11:47:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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 183 [2022-04-15 11:47:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:47:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:47:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:47:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-15 11:47:20,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-15 11:47:21,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:21,219 INFO L225 Difference]: With dead ends: 2632 [2022-04-15 11:47:21,219 INFO L226 Difference]: Without dead ends: 1502 [2022-04-15 11:47:21,221 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:47:21,221 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 73 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:21,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 534 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:47:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-04-15 11:47:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1167. [2022-04-15 11:47:21,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:21,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1502 states. Second operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 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:47:21,604 INFO L74 IsIncluded]: Start isIncluded. First operand 1502 states. Second operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 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:47:21,605 INFO L87 Difference]: Start difference. First operand 1502 states. Second operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 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:47:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:21,659 INFO L93 Difference]: Finished difference Result 1502 states and 2136 transitions. [2022-04-15 11:47:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2136 transitions. [2022-04-15 11:47:21,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:21,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:21,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 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 1502 states. [2022-04-15 11:47:21,663 INFO L87 Difference]: Start difference. First operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 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 1502 states. [2022-04-15 11:47:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:21,718 INFO L93 Difference]: Finished difference Result 1502 states and 2136 transitions. [2022-04-15 11:47:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2136 transitions. [2022-04-15 11:47:21,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:21,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:21,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:21,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1162 states have (on average 1.4173838209982788) internal successors, (1647), 1162 states have internal predecessors, (1647), 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:47:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1651 transitions. [2022-04-15 11:47:21,777 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1651 transitions. Word has length 183 [2022-04-15 11:47:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:21,778 INFO L478 AbstractCegarLoop]: Abstraction has 1167 states and 1651 transitions. [2022-04-15 11:47:21,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:47:21,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1167 states and 1651 transitions. [2022-04-15 11:47:23,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1651 edges. 1651 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1651 transitions. [2022-04-15 11:47:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-04-15 11:47:23,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:23,473 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:23,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:47:23,473 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1259168305, now seen corresponding path program 1 times [2022-04-15 11:47:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:23,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198300924] [2022-04-15 11:47:36,285 WARN L232 SmtUtils]: Spent 8.09s 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:47:42,814 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1259168305, now seen corresponding path program 2 times [2022-04-15 11:47:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:42,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200810393] [2022-04-15 11:47:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:43,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {150358#(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); {150351#true} is VALID [2022-04-15 11:47:43,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {150351#true} assume true; {150351#true} is VALID [2022-04-15 11:47:43,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150351#true} {150351#true} #593#return; {150351#true} is VALID [2022-04-15 11:47:43,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {150351#true} call ULTIMATE.init(); {150358#(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:47:43,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {150358#(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); {150351#true} is VALID [2022-04-15 11:47:43,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {150351#true} assume true; {150351#true} is VALID [2022-04-15 11:47:43,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150351#true} {150351#true} #593#return; {150351#true} is VALID [2022-04-15 11:47:43,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {150351#true} call #t~ret158 := main(); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {150351#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; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {150351#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {150351#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; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {150351#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; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {150351#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {150351#true} assume 12292 == #t~mem49;havoc #t~mem49; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {150351#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; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {150351#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {150351#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {150351#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {150351#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {150351#true} is VALID [2022-04-15 11:47:43,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {150351#true} assume !(0 == ~tmp___4~0); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {150351#true} assume 4368 == #t~mem54;havoc #t~mem54; {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {150351#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; {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {150351#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {150351#true} is VALID [2022-04-15 11:47:43,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {150351#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; {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 47: Hoare triple {150351#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 48: Hoare triple {150351#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {150351#true} assume 4384 == #t~mem56;havoc #t~mem56; {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {150351#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 51: Hoare triple {150351#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {150351#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {150351#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {150351#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {150351#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {150351#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {150351#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 68: Hoare triple {150351#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 69: Hoare triple {150351#true} assume 4400 == #t~mem58;havoc #t~mem58; {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 70: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 71: Hoare triple {150351#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; {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {150351#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 73: Hoare triple {150351#true} assume !(~ret~0 <= 0); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {150351#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 76: Hoare triple {150351#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 77: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 78: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-15 11:47:43,008 INFO L290 TraceCheckUtils]: 79: Hoare triple {150351#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); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {150351#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 81: Hoare triple {150351#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 82: Hoare triple {150351#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 83: Hoare triple {150351#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 84: Hoare triple {150351#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 85: Hoare triple {150351#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 86: Hoare triple {150351#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 87: Hoare triple {150351#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 88: Hoare triple {150351#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 89: Hoare triple {150351#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 90: Hoare triple {150351#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 91: Hoare triple {150351#true} assume 4416 == #t~mem60;havoc #t~mem60; {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 92: Hoare triple {150351#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150351#true} is VALID [2022-04-15 11:47:43,009 INFO L290 TraceCheckUtils]: 93: Hoare triple {150351#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {150351#true} is VALID [2022-04-15 11:47:43,010 INFO L290 TraceCheckUtils]: 94: Hoare triple {150351#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,011 INFO L290 TraceCheckUtils]: 95: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,011 INFO L290 TraceCheckUtils]: 96: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,011 INFO L290 TraceCheckUtils]: 97: Hoare triple {150356#(= 4432 (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; {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,011 INFO L290 TraceCheckUtils]: 98: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,011 INFO L290 TraceCheckUtils]: 99: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,012 INFO L290 TraceCheckUtils]: 100: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,012 INFO L290 TraceCheckUtils]: 101: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,012 INFO L290 TraceCheckUtils]: 102: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,012 INFO L290 TraceCheckUtils]: 103: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,013 INFO L290 TraceCheckUtils]: 104: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,013 INFO L290 TraceCheckUtils]: 105: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,013 INFO L290 TraceCheckUtils]: 106: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,013 INFO L290 TraceCheckUtils]: 107: Hoare triple {150356#(= 4432 (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); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,014 INFO L290 TraceCheckUtils]: 108: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,014 INFO L290 TraceCheckUtils]: 109: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,014 INFO L290 TraceCheckUtils]: 110: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,014 INFO L290 TraceCheckUtils]: 111: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,015 INFO L290 TraceCheckUtils]: 112: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-15 11:47:43,015 INFO L290 TraceCheckUtils]: 113: Hoare triple {150356#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {150357#(= |ssl3_connect_#t~mem62| 4432)} is VALID [2022-04-15 11:47:43,015 INFO L290 TraceCheckUtils]: 114: Hoare triple {150357#(= |ssl3_connect_#t~mem62| 4432)} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,015 INFO L290 TraceCheckUtils]: 115: Hoare triple {150352#false} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,015 INFO L290 TraceCheckUtils]: 116: Hoare triple {150352#false} assume 4448 == #t~mem64;havoc #t~mem64; {150352#false} is VALID [2022-04-15 11:47:43,015 INFO L290 TraceCheckUtils]: 117: Hoare triple {150352#false} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {150352#false} is VALID [2022-04-15 11:47:43,015 INFO L290 TraceCheckUtils]: 118: Hoare triple {150352#false} assume !(~ret~0 <= 0);call #t~mem101.base, #t~mem101.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem102 := read~int(#t~mem101.base, 852 + #t~mem101.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 119: Hoare triple {150352#false} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 120: Hoare triple {150352#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 121: Hoare triple {150352#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); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 122: Hoare triple {150352#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 123: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 124: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 125: Hoare triple {150352#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); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 126: Hoare triple {150352#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 127: Hoare triple {150352#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 128: Hoare triple {150352#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 129: Hoare triple {150352#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 130: Hoare triple {150352#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 131: Hoare triple {150352#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 132: Hoare triple {150352#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 133: Hoare triple {150352#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 134: Hoare triple {150352#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,016 INFO L290 TraceCheckUtils]: 135: Hoare triple {150352#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 136: Hoare triple {150352#false} assume 4401 == #t~mem59;havoc #t~mem59; {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 137: Hoare triple {150352#false} 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); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 138: Hoare triple {150352#false} 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; {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 139: Hoare triple {150352#false} assume !(2 == ~blastFlag~0); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 140: Hoare triple {150352#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 141: Hoare triple {150352#false} assume !(~ret~0 <= 0); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 142: Hoare triple {150352#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 143: Hoare triple {150352#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); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 144: Hoare triple {150352#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 145: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 146: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 147: Hoare triple {150352#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); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 148: Hoare triple {150352#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 149: Hoare triple {150352#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 150: Hoare triple {150352#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,017 INFO L290 TraceCheckUtils]: 151: Hoare triple {150352#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 152: Hoare triple {150352#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 153: Hoare triple {150352#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 154: Hoare triple {150352#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 155: Hoare triple {150352#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 156: Hoare triple {150352#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 157: Hoare triple {150352#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 158: Hoare triple {150352#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 159: Hoare triple {150352#false} assume 4416 == #t~mem60;havoc #t~mem60; {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 160: Hoare triple {150352#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 161: Hoare triple {150352#false} assume !(3 == ~blastFlag~0); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 162: Hoare triple {150352#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 163: Hoare triple {150352#false} assume !(0 == ~tmp___6~0); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 164: Hoare triple {150352#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); {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 165: Hoare triple {150352#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 166: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-15 11:47:43,018 INFO L290 TraceCheckUtils]: 167: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 168: Hoare triple {150352#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); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 169: Hoare triple {150352#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 170: Hoare triple {150352#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 171: Hoare triple {150352#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 172: Hoare triple {150352#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 173: Hoare triple {150352#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 174: Hoare triple {150352#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 175: Hoare triple {150352#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 176: Hoare triple {150352#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 177: Hoare triple {150352#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 178: Hoare triple {150352#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 179: Hoare triple {150352#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 180: Hoare triple {150352#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 181: Hoare triple {150352#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 182: Hoare triple {150352#false} assume 4432 == #t~mem62;havoc #t~mem62; {150352#false} is VALID [2022-04-15 11:47:43,019 INFO L290 TraceCheckUtils]: 183: Hoare triple {150352#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {150352#false} is VALID [2022-04-15 11:47:43,020 INFO L290 TraceCheckUtils]: 184: Hoare triple {150352#false} assume 5 == ~blastFlag~0; {150352#false} is VALID [2022-04-15 11:47:43,020 INFO L290 TraceCheckUtils]: 185: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-15 11:47:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-15 11:47:43,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:43,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200810393] [2022-04-15 11:47:43,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200810393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:43,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:43,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:43,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:43,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198300924] [2022-04-15 11:47:43,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198300924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:43,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:43,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159639508] [2022-04-15 11:47:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:43,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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 186 [2022-04-15 11:47:43,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:43,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:47:43,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:43,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:43,099 INFO L87 Difference]: Start difference. First operand 1167 states and 1651 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:47:45,118 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:47:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:46,659 INFO L93 Difference]: Finished difference Result 2452 states and 3458 transitions. [2022-04-15 11:47:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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 186 [2022-04-15 11:47:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:47:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-04-15 11:47:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:47:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-04-15 11:47:46,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 380 transitions. [2022-04-15 11:47:46,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:46,971 INFO L225 Difference]: With dead ends: 2452 [2022-04-15 11:47:46,971 INFO L226 Difference]: Without dead ends: 1301 [2022-04-15 11:47:46,973 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:47:46,973 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 23 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:46,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 474 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:47:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-04-15 11:47:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1263. [2022-04-15 11:47:47,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:47,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1301 states. Second operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 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:47:47,370 INFO L74 IsIncluded]: Start isIncluded. First operand 1301 states. Second operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 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:47:47,371 INFO L87 Difference]: Start difference. First operand 1301 states. Second operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 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:47:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:47,420 INFO L93 Difference]: Finished difference Result 1301 states and 1823 transitions. [2022-04-15 11:47:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1823 transitions. [2022-04-15 11:47:47,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:47,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:47,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 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 1301 states. [2022-04-15 11:47:47,423 INFO L87 Difference]: Start difference. First operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 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 1301 states. [2022-04-15 11:47:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:47,466 INFO L93 Difference]: Finished difference Result 1301 states and 1823 transitions. [2022-04-15 11:47:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1823 transitions. [2022-04-15 11:47:47,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:47,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:47,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:47,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1258 states have (on average 1.4141494435612083) internal successors, (1779), 1258 states have internal predecessors, (1779), 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:47:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1783 transitions. [2022-04-15 11:47:47,531 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1783 transitions. Word has length 186 [2022-04-15 11:47:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:47,532 INFO L478 AbstractCegarLoop]: Abstraction has 1263 states and 1783 transitions. [2022-04-15 11:47:47,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 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:47:47,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1263 states and 1783 transitions. [2022-04-15 11:47:49,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1783 edges. 1783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1783 transitions. [2022-04-15 11:47:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-15 11:47:49,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:49,386 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:49,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:47:49,386 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 1 times [2022-04-15 11:47:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:49,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101954342] [2022-04-15 11:48:07,673 WARN L232 SmtUtils]: Spent 12.06s 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:48:16,921 WARN L232 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-15 11:48:19,495 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 2 times [2022-04-15 11:48:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:19,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673304578] [2022-04-15 11:48:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:19,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:19,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {160402#(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); {160395#true} is VALID [2022-04-15 11:48:19,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {160395#true} assume true; {160395#true} is VALID [2022-04-15 11:48:19,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160395#true} {160395#true} #593#return; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {160395#true} call ULTIMATE.init(); {160402#(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:48:19,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {160402#(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); {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {160395#true} assume true; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160395#true} {160395#true} #593#return; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {160395#true} call #t~ret158 := main(); {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {160395#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; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {160395#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {160395#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; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {160395#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; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {160395#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {160395#true} assume 12292 == #t~mem49;havoc #t~mem49; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {160395#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; {160395#true} is VALID [2022-04-15 11:48:19,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {160395#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {160395#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {160395#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {160395#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {160395#true} assume !(0 == ~tmp___4~0); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {160395#true} assume 4368 == #t~mem54;havoc #t~mem54; {160395#true} is VALID [2022-04-15 11:48:19,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {160395#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; {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {160395#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {160395#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; {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {160395#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {160395#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {160395#true} assume 4384 == #t~mem56;havoc #t~mem56; {160395#true} is VALID [2022-04-15 11:48:19,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {160395#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {160395#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {160395#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {160395#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {160395#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 55: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 64: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 65: Hoare triple {160395#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 66: Hoare triple {160395#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {160395#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {160395#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 69: Hoare triple {160395#true} assume 4400 == #t~mem58;havoc #t~mem58; {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 71: Hoare triple {160395#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; {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 72: Hoare triple {160395#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 73: Hoare triple {160395#true} assume !(~ret~0 <= 0); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 74: Hoare triple {160395#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 75: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 76: Hoare triple {160395#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 77: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 79: Hoare triple {160395#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); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 80: Hoare triple {160395#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 81: Hoare triple {160395#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 82: Hoare triple {160395#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 83: Hoare triple {160395#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 84: Hoare triple {160395#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {160395#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 86: Hoare triple {160395#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 87: Hoare triple {160395#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 88: Hoare triple {160395#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 89: Hoare triple {160395#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {160395#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 91: Hoare triple {160395#true} assume 4416 == #t~mem60;havoc #t~mem60; {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 92: Hoare triple {160395#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {160395#true} is VALID [2022-04-15 11:48:19,682 INFO L290 TraceCheckUtils]: 93: Hoare triple {160395#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {160395#true} is VALID [2022-04-15 11:48:19,683 INFO L290 TraceCheckUtils]: 94: Hoare triple {160395#true} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,683 INFO L290 TraceCheckUtils]: 95: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,684 INFO L290 TraceCheckUtils]: 96: Hoare triple {160400#(not (= 4368 (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); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,684 INFO L290 TraceCheckUtils]: 97: Hoare triple {160400#(not (= 4368 (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; {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,684 INFO L290 TraceCheckUtils]: 98: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,685 INFO L290 TraceCheckUtils]: 99: Hoare triple {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,685 INFO L290 TraceCheckUtils]: 100: Hoare triple {160400#(not (= 4368 (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); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,685 INFO L290 TraceCheckUtils]: 101: Hoare triple {160400#(not (= 4368 (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); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,685 INFO L290 TraceCheckUtils]: 102: Hoare triple {160400#(not (= 4368 (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); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,686 INFO L290 TraceCheckUtils]: 103: Hoare triple {160400#(not (= 4368 (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); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,686 INFO L290 TraceCheckUtils]: 104: Hoare triple {160400#(not (= 4368 (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); {160400#(not (= 4368 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-15 11:48:19,686 INFO L290 TraceCheckUtils]: 105: Hoare triple {160400#(not (= 4368 (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); {160401#(not (= |ssl3_connect_#t~mem54| 4368))} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 106: Hoare triple {160401#(not (= |ssl3_connect_#t~mem54| 4368))} assume 4368 == #t~mem54;havoc #t~mem54; {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 107: Hoare triple {160396#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 108: Hoare triple {160396#false} assume !(0 == ~blastFlag~0); {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 109: Hoare triple {160396#false} 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); {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 110: Hoare triple {160396#false} 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; {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 111: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 112: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 113: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 114: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 115: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 116: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 117: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 118: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,687 INFO L290 TraceCheckUtils]: 119: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 120: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 121: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 122: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 123: Hoare triple {160396#false} assume 4384 == #t~mem56;havoc #t~mem56; {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 124: Hoare triple {160396#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 125: Hoare triple {160396#false} assume !(1 == ~blastFlag~0); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 126: Hoare triple {160396#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 127: Hoare triple {160396#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 128: Hoare triple {160396#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 129: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 130: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 131: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 132: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 133: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 134: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 135: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 136: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,688 INFO L290 TraceCheckUtils]: 137: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 138: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 139: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 140: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 141: Hoare triple {160396#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 142: Hoare triple {160396#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 143: Hoare triple {160396#false} assume 4400 == #t~mem58;havoc #t~mem58; {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 144: Hoare triple {160396#false} 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); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 145: Hoare triple {160396#false} 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; {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 146: Hoare triple {160396#false} assume !(2 == ~blastFlag~0); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 147: Hoare triple {160396#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 148: Hoare triple {160396#false} assume !(~ret~0 <= 0); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 149: Hoare triple {160396#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 150: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 151: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 152: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 153: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 154: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,689 INFO L290 TraceCheckUtils]: 155: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 156: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 157: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 158: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 159: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 160: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 161: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 162: Hoare triple {160396#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 163: Hoare triple {160396#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 164: Hoare triple {160396#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 165: Hoare triple {160396#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 166: Hoare triple {160396#false} assume 4416 == #t~mem60;havoc #t~mem60; {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 167: Hoare triple {160396#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 168: Hoare triple {160396#false} assume !(3 == ~blastFlag~0); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 169: Hoare triple {160396#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 170: Hoare triple {160396#false} assume !(0 == ~tmp___6~0); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 171: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 172: Hoare triple {160396#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {160396#false} is VALID [2022-04-15 11:48:19,690 INFO L290 TraceCheckUtils]: 173: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 174: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 175: Hoare triple {160396#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); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 176: Hoare triple {160396#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 177: Hoare triple {160396#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 178: Hoare triple {160396#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 179: Hoare triple {160396#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 180: Hoare triple {160396#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 181: Hoare triple {160396#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 182: Hoare triple {160396#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 183: Hoare triple {160396#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 184: Hoare triple {160396#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 185: Hoare triple {160396#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 186: Hoare triple {160396#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 187: Hoare triple {160396#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 188: Hoare triple {160396#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 189: Hoare triple {160396#false} assume 4432 == #t~mem62;havoc #t~mem62; {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 190: Hoare triple {160396#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {160396#false} is VALID [2022-04-15 11:48:19,691 INFO L290 TraceCheckUtils]: 191: Hoare triple {160396#false} assume 5 == ~blastFlag~0; {160396#false} is VALID [2022-04-15 11:48:19,692 INFO L290 TraceCheckUtils]: 192: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-15 11:48:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-15 11:48:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:19,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673304578] [2022-04-15 11:48:19,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673304578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:19,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:19,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:19,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:19,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101954342] [2022-04-15 11:48:19,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101954342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:19,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:19,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080239609] [2022-04-15 11:48:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:19,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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 193 [2022-04-15 11:48:19,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:19,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:48:19,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:19,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:19,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:19,770 INFO L87 Difference]: Start difference. First operand 1263 states and 1783 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:48:21,788 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:48:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:23,845 INFO L93 Difference]: Finished difference Result 2743 states and 3882 transitions. [2022-04-15 11:48:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:23,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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 193 [2022-04-15 11:48:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:48:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-15 11:48:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:48:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-15 11:48:23,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-15 11:48:24,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:24,281 INFO L225 Difference]: With dead ends: 2743 [2022-04-15 11:48:24,282 INFO L226 Difference]: Without dead ends: 1728 [2022-04-15 11:48:24,283 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:48:24,283 INFO L913 BasicCegarLoop]: 204 mSDtfsCounter, 110 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:24,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 490 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 494 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 11:48:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-04-15 11:48:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1343. [2022-04-15 11:48:24,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:24,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1728 states. Second operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 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:48:24,726 INFO L74 IsIncluded]: Start isIncluded. First operand 1728 states. Second operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 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:48:24,726 INFO L87 Difference]: Start difference. First operand 1728 states. Second operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 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:48:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:24,805 INFO L93 Difference]: Finished difference Result 1728 states and 2413 transitions. [2022-04-15 11:48:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2413 transitions. [2022-04-15 11:48:24,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:24,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:24,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 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 1728 states. [2022-04-15 11:48:24,809 INFO L87 Difference]: Start difference. First operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 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 1728 states. [2022-04-15 11:48:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:24,888 INFO L93 Difference]: Finished difference Result 1728 states and 2413 transitions. [2022-04-15 11:48:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2413 transitions. [2022-04-15 11:48:24,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:24,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:24,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:24,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1338 states have (on average 1.3863976083707026) internal successors, (1855), 1338 states have internal predecessors, (1855), 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:48:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1859 transitions. [2022-04-15 11:48:24,970 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1859 transitions. Word has length 193 [2022-04-15 11:48:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:24,970 INFO L478 AbstractCegarLoop]: Abstraction has 1343 states and 1859 transitions. [2022-04-15 11:48:24,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 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:48:24,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1343 states and 1859 transitions. [2022-04-15 11:48:27,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1859 transitions. [2022-04-15 11:48:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-15 11:48:27,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:27,006 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:27,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:48:27,006 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 1 times [2022-04-15 11:48:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:27,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213411096] [2022-04-15 11:48:41,852 WARN L232 SmtUtils]: Spent 9.46s 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)