/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-34549b5 [2022-04-08 08:36:05,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:36:05,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:36:05,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:36:05,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:36:05,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:36:05,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:36:05,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:36:05,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:36:05,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:36:05,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:36:05,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:36:05,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:36:05,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:36:05,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:36:05,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:36:05,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:36:05,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:36:05,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:36:05,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:36:05,088 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:36:05,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:36:05,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:36:05,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:36:05,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:36:05,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:36:05,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:36:05,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:36:05,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:36:05,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:36:05,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:36:05,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:36:05,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:36:05,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:36:05,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:36:05,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:36:05,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:36:05,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:36:05,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:36:05,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:36:05,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:36:05,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:36:05,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:36:05,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:36:05,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:36:05,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:36:05,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:36:05,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:36:05,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:36:05,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:36:05,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:36:05,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:36:05,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:36:05,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:36:05,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:36:05,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:36:05,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:36:05,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:36:05,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:36:05,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:36:05,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:36:05,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:36:05,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:36:05,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:36:05,111 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:36:05,111 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:36:05,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:36:05,112 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:36:05,112 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-08 08:36:05,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:36:05,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:36:05,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:36:05,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:36:05,297 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:36:05,298 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-08 08:36:05,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be90f61b1/af65cba752514d31b890a92244a8a88a/FLAG1970c8c5d [2022-04-08 08:36:05,738 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:36:05,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.04.i.cil-2.c [2022-04-08 08:36:05,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be90f61b1/af65cba752514d31b890a92244a8a88a/FLAG1970c8c5d [2022-04-08 08:36:06,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be90f61b1/af65cba752514d31b890a92244a8a88a [2022-04-08 08:36:06,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:36:06,095 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:36:06,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:36:06,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:36:06,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:36:06,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc3dbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06, skipping insertion in model container [2022-04-08 08:36:06,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:36:06,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:36:06,554 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-08 08:36:06,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:36:06,585 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:36:06,677 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-08 08:36:06,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:36:06,695 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:36:06,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06 WrapperNode [2022-04-08 08:36:06,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:36:06,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:36:06,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:36:06,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:36:06,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:36:06,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:36:06,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:36:06,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:36:06,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (1/1) ... [2022-04-08 08:36:06,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:36:06,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:36:06,834 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-08 08:36:06,838 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-08 08:36:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:36:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:36:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:36:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 08:36:06,880 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 08:36:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:36:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 08:36:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:36:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:36:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:36:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:36:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:36:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:36:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:36:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:36:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:36:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:36:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:36:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:36:06,992 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:36:06,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:36:08,296 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:36:08,680 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 08:36:08,680 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 08:36:08,700 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:36:08,705 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:36:08,706 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:36:08,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:36:08 BoogieIcfgContainer [2022-04-08 08:36:08,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:36:08,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:36:08,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:36:08,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:36:08,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:36:06" (1/3) ... [2022-04-08 08:36:08,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f979742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:36:08, skipping insertion in model container [2022-04-08 08:36:08,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:36:06" (2/3) ... [2022-04-08 08:36:08,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f979742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:36:08, skipping insertion in model container [2022-04-08 08:36:08,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:36:08" (3/3) ... [2022-04-08 08:36:08,718 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-2.c [2022-04-08 08:36:08,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:36:08,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:36:08,761 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:36:08,776 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-08 08:36:08,776 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:36:08,796 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-08 08:36:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:36:08,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:08,829 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-08 08:36:08,830 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-08 08:36:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:08,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636096548] [2022-04-08 08:36:08,854 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:36:08,854 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-08 08:36:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:08,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249141011] [2022-04-08 08:36:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:09,333 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-08 08:36:09,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 08:36:09,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 08:36:09,336 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-08 08:36:09,336 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-08 08:36:09,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 08:36:09,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 08:36:09,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-08 08:36:09,340 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-08 08:36:09,341 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-08 08:36:09,343 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-08 08:36:09,344 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-08 08:36:09,345 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-08 08:36:09,345 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-08 08:36:09,345 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-08 08:36:09,346 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-08 08:36:09,346 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-08 08:36:09,347 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-08 08:36:09,347 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-08 08:36:09,348 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-08 08:36:09,349 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-08 08:36:09,349 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-08 08:36:09,349 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-08 08:36:09,349 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-08 08:36:09,350 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-08 08:36:09,350 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-08 08:36:09,350 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-08 08:36:09,351 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-08 08:36:09,351 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-08 08:36:09,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-08 08:36:09,351 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-08 08:36:09,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 5 == ~blastFlag~0; {142#false} is VALID [2022-04-08 08:36:09,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-08 08:36:09,353 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-08 08:36:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:09,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249141011] [2022-04-08 08:36:09,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249141011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:09,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:09,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:09,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:09,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636096548] [2022-04-08 08:36:09,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636096548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:09,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:09,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:09,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102717992] [2022-04-08 08:36:09,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:09,363 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-08 08:36:09,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:09,368 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-08 08:36:09,398 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-08 08:36:09,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:36:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:36:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:36:09,425 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-08 08:36:11,470 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-08 08:36:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:12,414 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-08 08:36:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:36:12,415 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-08 08:36:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:12,416 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-08 08:36:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 08:36:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 08:36:12,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-08 08:36:12,791 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-08 08:36:12,799 INFO L225 Difference]: With dead ends: 267 [2022-04-08 08:36:12,799 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 08:36:12,801 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-08 08:36:12,803 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-08 08:36:12,803 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-08 08:36:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 08:36:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-08 08:36:12,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:12,828 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-08 08:36:12,829 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-08 08:36:12,829 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-08 08:36:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:12,834 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 08:36:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 08:36:12,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:12,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:12,835 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-08 08:36:12,835 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-08 08:36:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:12,839 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 08:36:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 08:36:12,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:12,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:12,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:12,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:12,840 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-08 08:36:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-08 08:36:12,844 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-08 08:36:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:12,845 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-08 08:36:12,845 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-08 08:36:12,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-08 08:36:12,983 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-08 08:36:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-08 08:36:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 08:36:12,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:12,985 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-08 08:36:12,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:36:12,985 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-08 08:36:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771378980] [2022-04-08 08:36:12,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:36:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-08 08:36:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568283287] [2022-04-08 08:36:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:13,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:13,160 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-08 08:36:13,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 08:36:13,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 08:36:13,161 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-08 08:36:13,161 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-08 08:36:13,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 08:36:13,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 08:36:13,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-08 08:36:13,162 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-08 08:36:13,162 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-08 08:36:13,162 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-08 08:36:13,162 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-08 08:36:13,163 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-08 08:36:13,163 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-08 08:36:13,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:36:13,164 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-08 08:36:13,164 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-08 08:36:13,164 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-08 08:36:13,164 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-08 08:36:13,165 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-08 08:36:13,165 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-08 08:36:13,165 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-08 08:36:13,166 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-08 08:36:13,166 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-08 08:36:13,166 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-08 08:36:13,167 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-08 08:36:13,167 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-08 08:36:13,167 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-08 08:36:13,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:36:13,168 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-08 08:36:13,168 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-08 08:36:13,168 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-08 08:36:13,168 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-08 08:36:13,169 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-08 08:36:13,169 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-08 08:36:13,169 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-08 08:36:13,170 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-08 08:36:13,170 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-08 08:36:13,170 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-08 08:36:13,170 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-08 08:36:13,171 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-08 08:36:13,171 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-08 08:36:13,171 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-08 08:36:13,172 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-08 08:36:13,172 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-08 08:36:13,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1174#false} is VALID [2022-04-08 08:36:13,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-08 08:36:13,173 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-08 08:36:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:13,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568283287] [2022-04-08 08:36:13,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568283287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:13,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:13,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:36:13,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:13,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771378980] [2022-04-08 08:36:13,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771378980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:13,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:13,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:36:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635924664] [2022-04-08 08:36:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:13,175 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-08 08:36:13,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:13,175 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-08 08:36:13,203 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-08 08:36:13,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:36:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:36:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:36:13,204 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-08 08:36:15,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:36:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:15,782 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2022-04-08 08:36:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:36:15,782 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-08 08:36:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:15,782 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-08 08:36:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 08:36:15,787 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-08 08:36:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 08:36:15,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-08 08:36:16,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:36:16,126 INFO L225 Difference]: With dead ends: 327 [2022-04-08 08:36:16,126 INFO L226 Difference]: Without dead ends: 222 [2022-04-08 08:36:16,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:36:16,127 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-08 08:36:16,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:36:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-08 08:36:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-08 08:36:16,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:16,138 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-08 08:36:16,138 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-08 08:36:16,151 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-08 08:36:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:16,158 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-08 08:36:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 08:36:16,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:16,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:16,159 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-08 08:36:16,160 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-08 08:36:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:16,166 INFO L93 Difference]: Finished difference Result 222 states and 326 transitions. [2022-04-08 08:36:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 08:36:16,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:16,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:16,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:16,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:16,167 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-08 08:36:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2022-04-08 08:36:16,173 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 44 [2022-04-08 08:36:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:16,174 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2022-04-08 08:36:16,174 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-08 08:36:16,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 326 transitions. [2022-04-08 08:36:16,397 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-08 08:36:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2022-04-08 08:36:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 08:36:16,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:16,399 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-08 08:36:16,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:36:16,400 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 1 times [2022-04-08 08:36:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:16,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239621071] [2022-04-08 08:36:16,401 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:36:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -446115060, now seen corresponding path program 2 times [2022-04-08 08:36:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:16,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990728638] [2022-04-08 08:36:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:16,622 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-08 08:36:16,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-08 08:36:16,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-08 08:36:16,624 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-08 08:36:16,624 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-08 08:36:16,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2022-04-08 08:36:16,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #593#return; {2724#true} is VALID [2022-04-08 08:36:16,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret158 := main(); {2724#true} is VALID [2022-04-08 08:36:16,624 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-08 08:36:16,624 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-08 08:36:16,624 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-08 08:36:16,624 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-08 08:36:16,625 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-08 08:36:16,625 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-08 08:36:16,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-08 08:36:16,625 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-08 08:36:16,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {2724#true} assume 12292 == #t~mem49;havoc #t~mem49; {2724#true} is VALID [2022-04-08 08:36:16,625 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-08 08:36:16,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2724#true} is VALID [2022-04-08 08:36:16,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {2724#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2724#true} is VALID [2022-04-08 08:36:16,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2724#true} is VALID [2022-04-08 08:36:16,625 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-08 08:36:16,626 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-08 08:36:16,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {2724#true} assume !(0 == ~tmp___4~0); {2724#true} is VALID [2022-04-08 08:36:16,626 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-08 08:36:16,626 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-08 08:36:16,626 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-08 08:36:16,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {2724#true} ~skip~0 := 0; {2724#true} is VALID [2022-04-08 08:36:16,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {2724#true} assume !false; {2724#true} is VALID [2022-04-08 08:36:16,626 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-08 08:36:16,626 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-08 08:36:16,626 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-08 08:36:16,627 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-08 08:36:16,627 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-08 08:36:16,627 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-08 08:36:16,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#true} assume 4368 == #t~mem54;havoc #t~mem54; {2724#true} is VALID [2022-04-08 08:36:16,627 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-08 08:36:16,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2724#true} is VALID [2022-04-08 08:36:16,649 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-08 08:36:16,650 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-08 08:36:16,664 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-08 08:36:16,665 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-08 08:36:16,665 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-08 08:36:16,666 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-08 08:36:16,666 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-08 08:36:16,666 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-08 08:36:16,667 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-08 08:36:16,667 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-08 08:36:16,668 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-08 08:36:16,668 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-08 08:36:16,668 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-08 08:36:16,669 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-08 08:36:16,669 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-08 08:36:16,669 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-08 08:36:16,669 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-08 08:36:16,669 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-08 08:36:16,670 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-08 08:36:16,670 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-08 08:36:16,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {2725#false} assume 4432 == #t~mem62;havoc #t~mem62; {2725#false} is VALID [2022-04-08 08:36:16,670 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-08 08:36:16,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {2725#false} assume 5 == ~blastFlag~0; {2725#false} is VALID [2022-04-08 08:36:16,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2022-04-08 08:36:16,670 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-08 08:36:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:16,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990728638] [2022-04-08 08:36:16,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990728638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:16,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:16,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:16,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:16,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239621071] [2022-04-08 08:36:16,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239621071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:16,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:16,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407306179] [2022-04-08 08:36:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:16,672 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-08 08:36:16,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:16,672 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-08 08:36:16,726 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-08 08:36:16,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:36:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:36:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:36:16,727 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-08 08:36:18,749 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-08 08:36:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:19,720 INFO L93 Difference]: Finished difference Result 362 states and 537 transitions. [2022-04-08 08:36:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:36:19,721 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-08 08:36:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:19,721 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-08 08:36:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 08:36:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 08:36:19,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-08 08:36:19,984 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-08 08:36:19,988 INFO L225 Difference]: With dead ends: 362 [2022-04-08 08:36:19,988 INFO L226 Difference]: Without dead ends: 257 [2022-04-08 08:36:19,988 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-08 08:36:19,989 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:36:19,989 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.3s Time] [2022-04-08 08:36:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-08 08:36:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 240. [2022-04-08 08:36:20,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:20,003 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-08 08:36:20,003 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-08 08:36:20,003 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-08 08:36:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:20,015 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-08 08:36:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-08 08:36:20,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:20,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:20,016 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-08 08:36:20,017 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-08 08:36:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:20,023 INFO L93 Difference]: Finished difference Result 257 states and 378 transitions. [2022-04-08 08:36:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2022-04-08 08:36:20,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:20,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:20,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:20,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:20,024 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-08 08:36:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2022-04-08 08:36:20,030 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 59 [2022-04-08 08:36:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:20,030 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2022-04-08 08:36:20,031 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-08 08:36:20,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 356 transitions. [2022-04-08 08:36:20,295 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-08 08:36:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2022-04-08 08:36:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 08:36:20,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:20,297 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-08 08:36:20,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:36:20,297 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 3 times [2022-04-08 08:36:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:20,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [270243580] [2022-04-08 08:36:28,607 WARN L232 SmtUtils]: Spent 8.31s 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-08 08:36:36,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:36:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2084364124, now seen corresponding path program 4 times [2022-04-08 08:36:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:36,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006792859] [2022-04-08 08:36:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:36,413 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-08 08:36:36,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-08 08:36:36,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-08 08:36:36,415 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-08 08:36:36,415 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-08 08:36:36,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#true} assume true; {4454#true} is VALID [2022-04-08 08:36:36,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#true} {4454#true} #593#return; {4454#true} is VALID [2022-04-08 08:36:36,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#true} call #t~ret158 := main(); {4454#true} is VALID [2022-04-08 08:36:36,415 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-08 08:36:36,415 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-08 08:36:36,415 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-08 08:36:36,415 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-08 08:36:36,416 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-08 08:36:36,416 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-08 08:36:36,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-08 08:36:36,416 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-08 08:36:36,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#true} assume 12292 == #t~mem49;havoc #t~mem49; {4454#true} is VALID [2022-04-08 08:36:36,416 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-08 08:36:36,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {4454#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4454#true} is VALID [2022-04-08 08:36:36,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4454#true} is VALID [2022-04-08 08:36:36,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {4454#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4454#true} is VALID [2022-04-08 08:36:36,416 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-08 08:36:36,416 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-08 08:36:36,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {4454#true} assume !(0 == ~tmp___4~0); {4454#true} is VALID [2022-04-08 08:36:36,416 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-08 08:36:36,417 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-08 08:36:36,417 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-08 08:36:36,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {4454#true} ~skip~0 := 0; {4454#true} is VALID [2022-04-08 08:36:36,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {4454#true} assume !false; {4454#true} is VALID [2022-04-08 08:36:36,417 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-08 08:36:36,417 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-08 08:36:36,417 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-08 08:36:36,418 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-08 08:36:36,418 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-08 08:36:36,418 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-08 08:36:36,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {4454#true} assume 4368 == #t~mem54;havoc #t~mem54; {4454#true} is VALID [2022-04-08 08:36:36,419 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-08 08:36:36,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {4454#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4454#true} is VALID [2022-04-08 08:36:36,420 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-08 08:36:36,420 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-08 08:36:36,421 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-08 08:36:36,421 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-08 08:36:36,421 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-08 08:36:36,421 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-08 08:36:36,422 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-08 08:36:36,422 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-08 08:36:36,423 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-08 08:36:36,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {4455#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4455#false} is VALID [2022-04-08 08:36:36,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {4455#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4455#false} is VALID [2022-04-08 08:36:36,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {4455#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {4455#false} is VALID [2022-04-08 08:36:36,423 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-08 08:36:36,423 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-08 08:36:36,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {4455#false} assume !(0 == ~tmp___4~0); {4455#false} is VALID [2022-04-08 08:36:36,423 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-08 08:36:36,423 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-08 08:36:36,423 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-08 08:36:36,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {4455#false} ~skip~0 := 0; {4455#false} is VALID [2022-04-08 08:36:36,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-08 08:36:36,423 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-08 08:36:36,426 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-08 08:36:36,426 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-08 08:36:36,426 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-08 08:36:36,426 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-08 08:36:36,426 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-08 08:36:36,426 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-08 08:36:36,426 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-08 08:36:36,427 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-08 08:36:36,427 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-08 08:36:36,427 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-08 08:36:36,427 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-08 08:36:36,427 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-08 08:36:36,427 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-08 08:36:36,427 INFO L290 TraceCheckUtils]: 69: Hoare triple {4455#false} assume 4432 == #t~mem62;havoc #t~mem62; {4455#false} is VALID [2022-04-08 08:36:36,427 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-08 08:36:36,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {4455#false} assume 5 == ~blastFlag~0; {4455#false} is VALID [2022-04-08 08:36:36,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {4455#false} assume !false; {4455#false} is VALID [2022-04-08 08:36:36,428 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-08 08:36:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:36,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006792859] [2022-04-08 08:36:36,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006792859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:36,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:36,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:36,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [270243580] [2022-04-08 08:36:36,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [270243580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:36,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571396606] [2022-04-08 08:36:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:36,430 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-08 08:36:36,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:36,431 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-08 08:36:36,484 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-08 08:36:36,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:36:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:36,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:36:36,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:36:36,486 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-08 08:36:38,507 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-08 08:36:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:39,427 INFO L93 Difference]: Finished difference Result 645 states and 966 transitions. [2022-04-08 08:36:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:36:39,427 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-08 08:36:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:39,428 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-08 08:36:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:36:39,442 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-08 08:36:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:36:39,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 08:36:39,732 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-08 08:36:39,742 INFO L225 Difference]: With dead ends: 645 [2022-04-08 08:36:39,742 INFO L226 Difference]: Without dead ends: 421 [2022-04-08 08:36:39,745 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-08 08:36:39,746 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:36:39,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 379 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:36:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-04-08 08:36:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 262. [2022-04-08 08:36:39,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:39,778 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-08 08:36:39,778 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-08 08:36:39,779 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-08 08:36:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:39,787 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-08 08:36:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-08 08:36:39,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:39,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:39,789 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-08 08:36:39,789 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-08 08:36:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:39,797 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2022-04-08 08:36:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2022-04-08 08:36:39,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:39,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:39,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:39,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:39,798 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-08 08:36:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 387 transitions. [2022-04-08 08:36:39,802 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 387 transitions. Word has length 73 [2022-04-08 08:36:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:39,803 INFO L478 AbstractCegarLoop]: Abstraction has 262 states and 387 transitions. [2022-04-08 08:36:39,803 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-08 08:36:39,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 262 states and 387 transitions. [2022-04-08 08:36:40,125 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-08 08:36:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 387 transitions. [2022-04-08 08:36:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 08:36:40,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:40,127 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-08 08:36:40,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:36:40,127 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:40,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 1 times [2022-04-08 08:36:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:40,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1630928863] [2022-04-08 08:36:54,962 WARN L232 SmtUtils]: Spent 10.27s 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-08 08:37:02,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1101622726, now seen corresponding path program 2 times [2022-04-08 08:37:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:02,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94087574] [2022-04-08 08:37:02,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:02,310 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-08 08:37:02,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-08 08:37:02,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-08 08:37:02,311 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-08 08:37:02,311 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-08 08:37:02,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {7122#true} assume true; {7122#true} is VALID [2022-04-08 08:37:02,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7122#true} {7122#true} #593#return; {7122#true} is VALID [2022-04-08 08:37:02,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {7122#true} call #t~ret158 := main(); {7122#true} is VALID [2022-04-08 08:37:02,311 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-08 08:37:02,311 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-08 08:37:02,311 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-08 08:37:02,311 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-08 08:37:02,311 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-08 08:37:02,312 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-08 08:37:02,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-08 08:37:02,312 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-08 08:37:02,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {7122#true} assume 12292 == #t~mem49;havoc #t~mem49; {7122#true} is VALID [2022-04-08 08:37:02,312 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-08 08:37:02,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {7122#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7122#true} is VALID [2022-04-08 08:37:02,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {7122#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7122#true} is VALID [2022-04-08 08:37:02,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {7122#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7122#true} is VALID [2022-04-08 08:37:02,313 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-08 08:37:02,313 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-08 08:37:02,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {7122#true} assume !(0 == ~tmp___4~0); {7122#true} is VALID [2022-04-08 08:37:02,313 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-08 08:37:02,313 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-08 08:37:02,313 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-08 08:37:02,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {7122#true} ~skip~0 := 0; {7122#true} is VALID [2022-04-08 08:37:02,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {7122#true} assume !false; {7122#true} is VALID [2022-04-08 08:37:02,321 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-08 08:37:02,326 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-08 08:37:02,326 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-08 08:37:02,327 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-08 08:37:02,327 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-08 08:37:02,327 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-08 08:37:02,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {7122#true} assume 4368 == #t~mem54;havoc #t~mem54; {7122#true} is VALID [2022-04-08 08:37:02,327 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-08 08:37:02,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {7122#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7122#true} is VALID [2022-04-08 08:37:02,328 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-08 08:37:02,329 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-08 08:37:02,329 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-08 08:37:02,329 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-08 08:37:02,330 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-08 08:37:02,330 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-08 08:37:02,330 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-08 08:37:02,331 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-08 08:37:02,331 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-08 08:37:02,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {7123#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7123#false} is VALID [2022-04-08 08:37:02,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {7123#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7123#false} is VALID [2022-04-08 08:37:02,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {7123#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {7123#false} is VALID [2022-04-08 08:37:02,332 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-08 08:37:02,333 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-08 08:37:02,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {7123#false} assume !(0 == ~tmp___4~0); {7123#false} is VALID [2022-04-08 08:37:02,333 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-08 08:37:02,333 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-08 08:37:02,333 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-08 08:37:02,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {7123#false} ~skip~0 := 0; {7123#false} is VALID [2022-04-08 08:37:02,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-08 08:37:02,333 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-08 08:37:02,333 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 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-08 08:37:02,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {7123#false} assume 4432 == #t~mem62;havoc #t~mem62; {7123#false} is VALID [2022-04-08 08:37:02,334 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-08 08:37:02,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {7123#false} assume 5 == ~blastFlag~0; {7123#false} is VALID [2022-04-08 08:37:02,335 INFO L290 TraceCheckUtils]: 72: Hoare triple {7123#false} assume !false; {7123#false} is VALID [2022-04-08 08:37:02,336 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-08 08:37:02,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:02,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94087574] [2022-04-08 08:37:02,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94087574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:02,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:02,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:02,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:02,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1630928863] [2022-04-08 08:37:02,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1630928863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:02,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:02,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:02,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840766587] [2022-04-08 08:37:02,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:02,338 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-08 08:37:02,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:02,339 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-08 08:37:02,391 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-08 08:37:02,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:02,392 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-08 08:37:04,413 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-08 08:37:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:05,387 INFO L93 Difference]: Finished difference Result 668 states and 995 transitions. [2022-04-08 08:37:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:05,388 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-08 08:37:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:05,388 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-08 08:37:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:37:05,391 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-08 08:37:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:37:05,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 08:37:05,713 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-08 08:37:05,721 INFO L225 Difference]: With dead ends: 668 [2022-04-08 08:37:05,721 INFO L226 Difference]: Without dead ends: 422 [2022-04-08 08:37:05,721 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-08 08:37:05,722 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-08 08:37:05,722 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-08 08:37:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-08 08:37:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 264. [2022-04-08 08:37:05,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:05,733 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-08 08:37:05,733 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-08 08:37:05,734 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-08 08:37:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:05,742 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-08 08:37:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-08 08:37:05,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:05,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:05,743 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-08 08:37:05,743 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-08 08:37:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:05,751 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2022-04-08 08:37:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2022-04-08 08:37:05,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:05,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:05,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:05,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:05,752 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-08 08:37:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2022-04-08 08:37:05,757 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 73 [2022-04-08 08:37:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:05,757 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2022-04-08 08:37:05,757 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-08 08:37:05,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 388 transitions. [2022-04-08 08:37:06,053 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-08 08:37:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2022-04-08 08:37:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 08:37:06,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:06,054 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-08 08:37:06,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:37:06,055 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 1 times [2022-04-08 08:37:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:06,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639456748] [2022-04-08 08:37:15,447 WARN L232 SmtUtils]: Spent 9.39s 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-08 08:37:28,584 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash -155040791, now seen corresponding path program 2 times [2022-04-08 08:37:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:28,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353186668] [2022-04-08 08:37:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:28,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:28,811 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-08 08:37:28,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-08 08:37:28,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-08 08:37:28,812 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-08 08:37:28,812 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-08 08:37:28,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {9842#true} assume true; {9842#true} is VALID [2022-04-08 08:37:28,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9842#true} {9842#true} #593#return; {9842#true} is VALID [2022-04-08 08:37:28,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {9842#true} call #t~ret158 := main(); {9842#true} is VALID [2022-04-08 08:37:28,812 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-08 08:37:28,812 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-08 08:37:28,812 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-08 08:37:28,812 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-08 08:37:28,812 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-08 08:37:28,812 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-08 08:37:28,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-08 08:37:28,813 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-08 08:37:28,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {9842#true} assume 12292 == #t~mem49;havoc #t~mem49; {9842#true} is VALID [2022-04-08 08:37:28,814 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-08 08:37:28,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {9842#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9842#true} is VALID [2022-04-08 08:37:28,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {9842#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9842#true} is VALID [2022-04-08 08:37:28,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {9842#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9842#true} is VALID [2022-04-08 08:37:28,814 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-08 08:37:28,814 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-08 08:37:28,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {9842#true} assume !(0 == ~tmp___4~0); {9842#true} is VALID [2022-04-08 08:37:28,814 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-08 08:37:28,814 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-08 08:37:28,814 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-08 08:37:28,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {9842#true} ~skip~0 := 0; {9842#true} is VALID [2022-04-08 08:37:28,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {9842#true} assume !false; {9842#true} is VALID [2022-04-08 08:37:28,814 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-08 08:37:28,814 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-08 08:37:28,814 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-08 08:37:28,814 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-08 08:37:28,815 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-08 08:37:28,815 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-08 08:37:28,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {9842#true} assume 4368 == #t~mem54;havoc #t~mem54; {9842#true} is VALID [2022-04-08 08:37:28,815 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-08 08:37:28,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {9842#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9842#true} is VALID [2022-04-08 08:37:28,816 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-08 08:37:28,816 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-08 08:37:28,817 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-08 08:37:28,817 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-08 08:37:28,817 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-08 08:37:28,817 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-08 08:37:28,818 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-08 08:37:28,818 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-08 08:37:28,819 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-08 08:37:28,819 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-08 08:37:28,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {9843#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9843#false} is VALID [2022-04-08 08:37:28,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {9843#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9843#false} is VALID [2022-04-08 08:37:28,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {9843#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {9843#false} is VALID [2022-04-08 08:37:28,819 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-08 08:37:28,819 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-08 08:37:28,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {9843#false} assume !(0 == ~tmp___4~0); {9843#false} is VALID [2022-04-08 08:37:28,823 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-08 08:37:28,823 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-08 08:37:28,823 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-08 08:37:28,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {9843#false} ~skip~0 := 0; {9843#false} is VALID [2022-04-08 08:37:28,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 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-08 08:37:28,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {9843#false} assume 4432 == #t~mem62;havoc #t~mem62; {9843#false} is VALID [2022-04-08 08:37:28,824 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-08 08:37:28,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {9843#false} assume 5 == ~blastFlag~0; {9843#false} is VALID [2022-04-08 08:37:28,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {9843#false} assume !false; {9843#false} is VALID [2022-04-08 08:37:28,825 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-08 08:37:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353186668] [2022-04-08 08:37:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353186668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:28,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:28,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639456748] [2022-04-08 08:37:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639456748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:28,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042299104] [2022-04-08 08:37:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:28,826 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-08 08:37:28,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:28,826 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-08 08:37:28,887 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-08 08:37:28,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:28,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:28,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:28,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:28,888 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-08 08:37:30,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:31,800 INFO L93 Difference]: Finished difference Result 415 states and 612 transitions. [2022-04-08 08:37:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:31,801 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-08 08:37:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:31,801 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-08 08:37:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-08 08:37:31,803 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-08 08:37:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 382 transitions. [2022-04-08 08:37:31,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 382 transitions. [2022-04-08 08:37:32,037 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-08 08:37:32,041 INFO L225 Difference]: With dead ends: 415 [2022-04-08 08:37:32,041 INFO L226 Difference]: Without dead ends: 280 [2022-04-08 08:37:32,042 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-08 08:37:32,042 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-08 08:37:32,042 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-08 08:37:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-08 08:37:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-08 08:37:32,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:32,050 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-08 08:37:32,051 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-08 08:37:32,051 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-08 08:37:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:32,056 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-08 08:37:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-08 08:37:32,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:32,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:32,057 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-08 08:37:32,057 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-08 08:37:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:32,061 INFO L93 Difference]: Finished difference Result 280 states and 408 transitions. [2022-04-08 08:37:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2022-04-08 08:37:32,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:32,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:32,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:32,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:32,062 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-08 08:37:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-04-08 08:37:32,066 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 74 [2022-04-08 08:37:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:32,066 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-04-08 08:37:32,066 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-08 08:37:32,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 387 transitions. [2022-04-08 08:37:32,360 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-08 08:37:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-04-08 08:37:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 08:37:32,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:32,361 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-08 08:37:32,361 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:37:32,361 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:32,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 1 times [2022-04-08 08:37:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:32,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513572505] [2022-04-08 08:37:44,801 WARN L232 SmtUtils]: Spent 8.11s 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-08 08:37:51,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash -400323519, now seen corresponding path program 2 times [2022-04-08 08:37:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:51,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896918105] [2022-04-08 08:37:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:52,056 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-08 08:37:52,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-08 08:37:52,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-08 08:37:52,057 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-08 08:37:52,057 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-08 08:37:52,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {11772#true} assume true; {11772#true} is VALID [2022-04-08 08:37:52,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11772#true} {11772#true} #593#return; {11772#true} is VALID [2022-04-08 08:37:52,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {11772#true} call #t~ret158 := main(); {11772#true} is VALID [2022-04-08 08:37:52,057 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-08 08:37:52,057 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-08 08:37:52,057 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-08 08:37:52,058 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-08 08:37:52,058 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-08 08:37:52,058 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-08 08:37:52,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-08 08:37:52,058 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-08 08:37:52,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {11772#true} assume 12292 == #t~mem49;havoc #t~mem49; {11772#true} is VALID [2022-04-08 08:37:52,058 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-08 08:37:52,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {11772#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11772#true} is VALID [2022-04-08 08:37:52,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {11772#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11772#true} is VALID [2022-04-08 08:37:52,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {11772#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11772#true} is VALID [2022-04-08 08:37:52,058 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-08 08:37:52,058 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-08 08:37:52,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {11772#true} assume !(0 == ~tmp___4~0); {11772#true} is VALID [2022-04-08 08:37:52,058 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-08 08:37:52,058 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-08 08:37:52,059 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-08 08:37:52,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {11772#true} ~skip~0 := 0; {11772#true} is VALID [2022-04-08 08:37:52,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {11772#true} assume !false; {11772#true} is VALID [2022-04-08 08:37:52,059 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-08 08:37:52,059 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-08 08:37:52,059 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-08 08:37:52,059 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-08 08:37:52,059 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-08 08:37:52,059 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-08 08:37:52,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {11772#true} assume 4368 == #t~mem54;havoc #t~mem54; {11772#true} is VALID [2022-04-08 08:37:52,059 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-08 08:37:52,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {11772#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11772#true} is VALID [2022-04-08 08:37:52,060 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-08 08:37:52,061 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-08 08:37:52,061 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-08 08:37:52,061 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-08 08:37:52,062 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-08 08:37:52,062 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-08 08:37:52,062 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-08 08:37:52,063 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-08 08:37:52,063 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-08 08:37:52,063 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-08 08:37:52,064 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-08 08:37:52,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {11773#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11773#false} is VALID [2022-04-08 08:37:52,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {11773#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11773#false} is VALID [2022-04-08 08:37:52,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {11773#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11773#false} is VALID [2022-04-08 08:37:52,064 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-08 08:37:52,064 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-08 08:37:52,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {11773#false} assume !(0 == ~tmp___4~0); {11773#false} is VALID [2022-04-08 08:37:52,064 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-08 08:37:52,064 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-08 08:37:52,064 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-08 08:37:52,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {11773#false} ~skip~0 := 0; {11773#false} is VALID [2022-04-08 08:37:52,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-08 08:37:52,064 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-08 08:37:52,064 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 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-08 08:37:52,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {11773#false} assume 4432 == #t~mem62;havoc #t~mem62; {11773#false} is VALID [2022-04-08 08:37:52,065 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-08 08:37:52,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {11773#false} assume 5 == ~blastFlag~0; {11773#false} is VALID [2022-04-08 08:37:52,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {11773#false} assume !false; {11773#false} is VALID [2022-04-08 08:37:52,066 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-08 08:37:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896918105] [2022-04-08 08:37:52,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896918105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:52,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:52,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:52,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513572505] [2022-04-08 08:37:52,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513572505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:52,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:52,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:37:52,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735322572] [2022-04-08 08:37:52,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:52,067 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-08 08:37:52,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:52,067 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-08 08:37:52,123 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-08 08:37:52,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:37:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:37:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:37:52,124 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-08 08:37:54,145 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-08 08:37:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:55,143 INFO L93 Difference]: Finished difference Result 415 states and 610 transitions. [2022-04-08 08:37:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:37:55,143 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-08 08:37:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:55,145 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-08 08:37:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-08 08:37:55,148 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-08 08:37:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 381 transitions. [2022-04-08 08:37:55,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 381 transitions. [2022-04-08 08:37:55,339 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-08 08:37:55,343 INFO L225 Difference]: With dead ends: 415 [2022-04-08 08:37:55,343 INFO L226 Difference]: Without dead ends: 280 [2022-04-08 08:37:55,343 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-08 08:37:55,344 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-08 08:37:55,344 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-08 08:37:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-08 08:37:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 264. [2022-04-08 08:37:55,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:55,353 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-08 08:37:55,353 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-08 08:37:55,354 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-08 08:37:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:55,375 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-08 08:37:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-08 08:37:55,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:55,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:55,376 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-08 08:37:55,376 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-08 08:37:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:55,381 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2022-04-08 08:37:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2022-04-08 08:37:55,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:55,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:55,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:55,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:55,382 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-08 08:37:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 386 transitions. [2022-04-08 08:37:55,387 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 386 transitions. Word has length 75 [2022-04-08 08:37:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:55,387 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 386 transitions. [2022-04-08 08:37:55,387 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-08 08:37:55,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 386 transitions. [2022-04-08 08:37:55,639 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-08 08:37:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 386 transitions. [2022-04-08 08:37:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 08:37:55,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:55,640 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-08 08:37:55,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:37:55,641 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 1 times [2022-04-08 08:37:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:55,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700477888] [2022-04-08 08:38:13,082 WARN L232 SmtUtils]: Spent 13.08s 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-08 08:38:20,490 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash 642427140, now seen corresponding path program 2 times [2022-04-08 08:38:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:20,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701821123] [2022-04-08 08:38:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:20,694 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-08 08:38:20,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-08 08:38:20,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-08 08:38:20,695 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-08 08:38:20,695 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-08 08:38:20,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-08 08:38:20,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13702#true} {13702#true} #593#return; {13702#true} is VALID [2022-04-08 08:38:20,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {13702#true} call #t~ret158 := main(); {13702#true} is VALID [2022-04-08 08:38:20,695 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-08 08:38:20,695 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-08 08:38:20,695 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-08 08:38:20,696 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-08 08:38:20,696 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-08 08:38:20,696 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-08 08:38:20,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-08 08:38:20,696 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-08 08:38:20,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {13702#true} assume 12292 == #t~mem49;havoc #t~mem49; {13702#true} is VALID [2022-04-08 08:38:20,696 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-08 08:38:20,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {13702#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13702#true} is VALID [2022-04-08 08:38:20,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {13702#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13702#true} is VALID [2022-04-08 08:38:20,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {13702#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13702#true} is VALID [2022-04-08 08:38:20,696 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-08 08:38:20,696 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-08 08:38:20,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {13702#true} assume !(0 == ~tmp___4~0); {13702#true} is VALID [2022-04-08 08:38:20,696 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-08 08:38:20,696 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-08 08:38:20,696 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-08 08:38:20,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {13702#true} ~skip~0 := 0; {13702#true} is VALID [2022-04-08 08:38:20,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {13702#true} assume !false; {13702#true} is VALID [2022-04-08 08:38:20,697 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-08 08:38:20,697 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-08 08:38:20,697 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-08 08:38:20,697 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-08 08:38:20,697 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-08 08:38:20,697 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-08 08:38:20,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {13702#true} assume 4368 == #t~mem54;havoc #t~mem54; {13702#true} is VALID [2022-04-08 08:38:20,697 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-08 08:38:20,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {13702#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13702#true} is VALID [2022-04-08 08:38:20,698 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-08 08:38:20,698 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-08 08:38:20,699 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-08 08:38:20,699 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-08 08:38:20,699 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-08 08:38:20,700 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-08 08:38:20,700 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-08 08:38:20,700 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-08 08:38:20,701 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-08 08:38:20,701 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-08 08:38:20,701 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-08 08:38:20,702 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-08 08:38:20,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {13703#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13703#false} is VALID [2022-04-08 08:38:20,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {13703#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13703#false} is VALID [2022-04-08 08:38:20,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {13703#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {13703#false} is VALID [2022-04-08 08:38:20,702 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-08 08:38:20,702 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-08 08:38:20,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {13703#false} assume !(0 == ~tmp___4~0); {13703#false} is VALID [2022-04-08 08:38:20,702 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-08 08:38:20,702 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-08 08:38:20,702 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-08 08:38:20,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {13703#false} ~skip~0 := 0; {13703#false} is VALID [2022-04-08 08:38:20,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-08 08:38:20,702 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-08 08:38:20,702 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-08 08:38:20,702 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-08 08:38:20,702 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,703 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-08 08:38:20,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {13703#false} assume 4432 == #t~mem62;havoc #t~mem62; {13703#false} is VALID [2022-04-08 08:38:20,704 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-08 08:38:20,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {13703#false} assume 5 == ~blastFlag~0; {13703#false} is VALID [2022-04-08 08:38:20,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-08 08:38:20,704 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-08 08:38:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:20,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701821123] [2022-04-08 08:38:20,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701821123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:20,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:20,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:20,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:20,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700477888] [2022-04-08 08:38:20,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700477888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:20,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:20,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:38:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819195827] [2022-04-08 08:38:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:20,705 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-08 08:38:20,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:20,706 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-08 08:38:20,763 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-08 08:38:20,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:38:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:38:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:38:20,764 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-08 08:38:22,786 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-08 08:38:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:23,619 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-04-08 08:38:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:38:23,629 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-08 08:38:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:23,629 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-08 08:38:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-08 08:38:23,633 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-08 08:38:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 369 transitions. [2022-04-08 08:38:23,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 369 transitions. [2022-04-08 08:38:24,034 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-08 08:38:24,038 INFO L225 Difference]: With dead ends: 406 [2022-04-08 08:38:24,038 INFO L226 Difference]: Without dead ends: 271 [2022-04-08 08:38:24,039 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-08 08:38:24,039 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-08 08:38:24,039 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-08 08:38:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-08 08:38:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 264. [2022-04-08 08:38:24,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:24,049 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-08 08:38:24,053 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-08 08:38:24,055 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-08 08:38:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:24,060 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-08 08:38:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-08 08:38:24,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:24,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:24,061 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-08 08:38:24,062 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-08 08:38:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:24,066 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2022-04-08 08:38:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 395 transitions. [2022-04-08 08:38:24,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:24,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:24,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:24,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:24,067 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-08 08:38:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 385 transitions. [2022-04-08 08:38:24,072 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 385 transitions. Word has length 76 [2022-04-08 08:38:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:24,072 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 385 transitions. [2022-04-08 08:38:24,072 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-08 08:38:24,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 385 transitions. [2022-04-08 08:38:24,384 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-08 08:38:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 385 transitions. [2022-04-08 08:38:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:38:24,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:24,385 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-08 08:38:24,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:38:24,385 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 1 times [2022-04-08 08:38:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:24,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015007390] [2022-04-08 08:38:24,386 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -790014140, now seen corresponding path program 2 times [2022-04-08 08:38:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:24,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593170011] [2022-04-08 08:38:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:24,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:24,555 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-08 08:38:24,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-08 08:38:24,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-08 08:38:24,556 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-08 08:38:24,556 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-08 08:38:24,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {15596#true} assume true; {15596#true} is VALID [2022-04-08 08:38:24,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15596#true} {15596#true} #593#return; {15596#true} is VALID [2022-04-08 08:38:24,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {15596#true} call #t~ret158 := main(); {15596#true} is VALID [2022-04-08 08:38:24,556 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-08 08:38:24,557 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-08 08:38:24,557 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-08 08:38:24,561 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-08 08:38:24,561 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-08 08:38:24,561 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-08 08:38:24,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-08 08:38:24,561 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-08 08:38:24,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {15596#true} assume 12292 == #t~mem49;havoc #t~mem49; {15596#true} is VALID [2022-04-08 08:38:24,562 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-08 08:38:24,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {15596#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15596#true} is VALID [2022-04-08 08:38:24,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {15596#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15596#true} is VALID [2022-04-08 08:38:24,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {15596#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {15596#true} is VALID [2022-04-08 08:38:24,562 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-08 08:38:24,562 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-08 08:38:24,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {15596#true} assume !(0 == ~tmp___4~0); {15596#true} is VALID [2022-04-08 08:38:24,562 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-08 08:38:24,562 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-08 08:38:24,562 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-08 08:38:24,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {15596#true} ~skip~0 := 0; {15596#true} is VALID [2022-04-08 08:38:24,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {15596#true} assume !false; {15596#true} is VALID [2022-04-08 08:38:24,562 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-08 08:38:24,562 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-08 08:38:24,562 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-08 08:38:24,562 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-08 08:38:24,563 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-08 08:38:24,563 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-08 08:38:24,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {15596#true} assume 4368 == #t~mem54;havoc #t~mem54; {15596#true} is VALID [2022-04-08 08:38:24,563 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-08 08:38:24,563 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-08 08:38:24,563 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-08 08:38:24,564 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-08 08:38:24,564 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-08 08:38:24,564 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-08 08:38:24,564 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-08 08:38:24,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !false; {15601#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:38:24,565 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-08 08:38:24,565 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-08 08:38:24,565 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-08 08:38:24,566 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-08 08:38:24,566 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-08 08:38:24,566 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-08 08:38:24,566 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-08 08:38:24,567 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-08 08:38:24,567 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-08 08:38:24,567 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-08 08:38:24,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {15601#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {15597#false} is VALID [2022-04-08 08:38:24,567 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-08 08:38:24,567 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-08 08:38:24,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {15597#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15597#false} is VALID [2022-04-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {15597#false} ~skip~0 := 0; {15597#false} is VALID [2022-04-08 08:38:24,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,568 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-08 08:38:24,569 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-08 08:38:24,570 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-08 08:38:24,570 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-08 08:38:24,570 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-08 08:38:24,570 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-08 08:38:24,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {15597#false} assume 4432 == #t~mem62;havoc #t~mem62; {15597#false} is VALID [2022-04-08 08:38:24,570 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-08 08:38:24,570 INFO L290 TraceCheckUtils]: 75: Hoare triple {15597#false} assume 5 == ~blastFlag~0; {15597#false} is VALID [2022-04-08 08:38:24,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {15597#false} assume !false; {15597#false} is VALID [2022-04-08 08:38:24,571 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-08 08:38:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593170011] [2022-04-08 08:38:24,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593170011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:24,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:24,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:24,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:24,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015007390] [2022-04-08 08:38:24,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015007390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:24,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:24,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606961946] [2022-04-08 08:38:24,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:24,572 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-08 08:38:24,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:24,572 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-08 08:38:24,629 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-08 08:38:24,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:38:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:24,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:38:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:38:24,630 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-08 08:38:26,646 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-08 08:38:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:27,190 INFO L93 Difference]: Finished difference Result 423 states and 619 transitions. [2022-04-08 08:38:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:38:27,190 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-08 08:38:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:27,196 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-08 08:38:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-08 08:38:27,199 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-08 08:38:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2022-04-08 08:38:27,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 367 transitions. [2022-04-08 08:38:27,444 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-08 08:38:27,449 INFO L225 Difference]: With dead ends: 423 [2022-04-08 08:38:27,449 INFO L226 Difference]: Without dead ends: 288 [2022-04-08 08:38:27,449 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-08 08:38:27,450 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:38:27,450 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-08 08:38:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-08 08:38:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-04-08 08:38:27,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:27,460 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-08 08:38:27,460 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-08 08:38:27,461 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-08 08:38:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:27,478 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-08 08:38:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-08 08:38:27,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:27,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:27,480 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-08 08:38:27,480 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-08 08:38:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:27,488 INFO L93 Difference]: Finished difference Result 288 states and 417 transitions. [2022-04-08 08:38:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-08 08:38:27,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:27,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:27,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:27,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:27,490 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-08 08:38:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2022-04-08 08:38:27,494 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 77 [2022-04-08 08:38:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:27,495 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-04-08 08:38:27,495 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-08 08:38:27,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 288 states and 417 transitions. [2022-04-08 08:38:27,868 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-08 08:38:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-04-08 08:38:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:38:27,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:27,869 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-08 08:38:27,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:38:27,869 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 1 times [2022-04-08 08:38:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:27,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713343342] [2022-04-08 08:38:27,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -852053754, now seen corresponding path program 2 times [2022-04-08 08:38:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:27,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140419775] [2022-04-08 08:38:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:28,037 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-08 08:38:28,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-08 08:38:28,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-08 08:38:28,038 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-08 08:38:28,038 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-08 08:38:28,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {17603#true} assume true; {17603#true} is VALID [2022-04-08 08:38:28,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17603#true} {17603#true} #593#return; {17603#true} is VALID [2022-04-08 08:38:28,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {17603#true} call #t~ret158 := main(); {17603#true} is VALID [2022-04-08 08:38:28,039 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-08 08:38:28,039 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-08 08:38:28,039 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-08 08:38:28,039 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-08 08:38:28,039 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-08 08:38:28,039 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-08 08:38:28,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-08 08:38:28,039 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-08 08:38:28,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {17603#true} assume 12292 == #t~mem49;havoc #t~mem49; {17603#true} is VALID [2022-04-08 08:38:28,039 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-08 08:38:28,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {17603#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {17603#true} is VALID [2022-04-08 08:38:28,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {17603#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {17603#true} is VALID [2022-04-08 08:38:28,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {17603#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {17603#true} is VALID [2022-04-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {17603#true} assume !(0 == ~tmp___4~0); {17603#true} is VALID [2022-04-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-08 08:38:28,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 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-08 08:38:28,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {17603#true} assume 4368 == #t~mem54;havoc #t~mem54; {17603#true} is VALID [2022-04-08 08:38:28,040 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-08 08:38:28,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {17603#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {17603#true} is VALID [2022-04-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {17603#true} ~skip~0 := 0; {17603#true} is VALID [2022-04-08 08:38:28,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {17603#true} assume !false; {17603#true} is VALID [2022-04-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 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-08 08:38:28,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {17603#true} assume 4384 == #t~mem56;havoc #t~mem56; {17603#true} is VALID [2022-04-08 08:38:28,041 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-08 08:38:28,042 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-08 08:38:28,042 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-08 08:38:28,042 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-08 08:38:28,042 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-08 08:38:28,043 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-08 08:38:28,043 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-08 08:38:28,043 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-08 08:38:28,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {17608#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:38:28,044 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-08 08:38:28,044 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-08 08:38:28,044 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-08 08:38:28,044 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-08 08:38:28,045 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-08 08:38:28,045 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-08 08:38:28,045 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-08 08:38:28,045 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-08 08:38:28,046 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-08 08:38:28,046 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-08 08:38:28,046 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-08 08:38:28,046 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-08 08:38:28,047 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-08 08:38:28,047 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-08 08:38:28,047 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-08 08:38:28,047 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-08 08:38:28,048 INFO L290 TraceCheckUtils]: 75: Hoare triple {17608#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {17604#false} is VALID [2022-04-08 08:38:28,048 INFO L290 TraceCheckUtils]: 76: Hoare triple {17604#false} assume !false; {17604#false} is VALID [2022-04-08 08:38:28,048 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-08 08:38:28,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:28,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140419775] [2022-04-08 08:38:28,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140419775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:28,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:28,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:28,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:28,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713343342] [2022-04-08 08:38:28,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713343342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:28,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:28,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:28,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67558462] [2022-04-08 08:38:28,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:28,049 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-08 08:38:28,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:28,050 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-08 08:38:28,098 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-08 08:38:28,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:38:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:38:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:38:28,099 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-08 08:38:30,116 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-08 08:38:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:31,011 INFO L93 Difference]: Finished difference Result 578 states and 845 transitions. [2022-04-08 08:38:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:38:31,012 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-08 08:38:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:31,012 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-08 08:38:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 08:38:31,014 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-08 08:38:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-04-08 08:38:31,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 487 transitions. [2022-04-08 08:38:31,367 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-08 08:38:31,403 INFO L225 Difference]: With dead ends: 578 [2022-04-08 08:38:31,404 INFO L226 Difference]: Without dead ends: 419 [2022-04-08 08:38:31,404 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-08 08:38:31,404 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-08 08:38:31,412 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-08 08:38:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-08 08:38:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2022-04-08 08:38:31,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:31,435 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-08 08:38:31,436 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-08 08:38:31,437 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-08 08:38:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:31,461 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-08 08:38:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-08 08:38:31,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:31,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:31,462 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-08 08:38:31,463 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-08 08:38:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:31,470 INFO L93 Difference]: Finished difference Result 419 states and 608 transitions. [2022-04-08 08:38:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-08 08:38:31,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:31,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:31,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:31,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:31,471 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-08 08:38:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 608 transitions. [2022-04-08 08:38:31,483 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 608 transitions. Word has length 77 [2022-04-08 08:38:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:31,484 INFO L478 AbstractCegarLoop]: Abstraction has 419 states and 608 transitions. [2022-04-08 08:38:31,493 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-08 08:38:31,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 419 states and 608 transitions. [2022-04-08 08:38:31,872 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-08 08:38:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 608 transitions. [2022-04-08 08:38:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 08:38:31,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:31,874 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-08 08:38:31,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:38:31,874 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 1 times [2022-04-08 08:38:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:31,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672011096] [2022-04-08 08:38:31,875 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash 58549480, now seen corresponding path program 2 times [2022-04-08 08:38:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:31,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456069995] [2022-04-08 08:38:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:32,061 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-08 08:38:32,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-08 08:38:32,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-08 08:38:32,062 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-08 08:38:32,062 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-08 08:38:32,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {20444#true} assume true; {20444#true} is VALID [2022-04-08 08:38:32,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20444#true} {20444#true} #593#return; {20444#true} is VALID [2022-04-08 08:38:32,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {20444#true} call #t~ret158 := main(); {20444#true} is VALID [2022-04-08 08:38:32,062 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-08 08:38:32,062 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-08 08:38:32,062 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-08 08:38:32,062 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-08 08:38:32,062 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-08 08:38:32,062 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-08 08:38:32,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-08 08:38:32,062 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-08 08:38:32,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {20444#true} assume 12292 == #t~mem49;havoc #t~mem49; {20444#true} is VALID [2022-04-08 08:38:32,063 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-08 08:38:32,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {20444#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {20444#true} is VALID [2022-04-08 08:38:32,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {20444#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20444#true} is VALID [2022-04-08 08:38:32,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {20444#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {20444#true} is VALID [2022-04-08 08:38:32,063 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-08 08:38:32,063 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-08 08:38:32,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {20444#true} assume !(0 == ~tmp___4~0); {20444#true} is VALID [2022-04-08 08:38:32,063 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-08 08:38:32,063 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-08 08:38:32,063 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-08 08:38:32,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-08 08:38:32,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-08 08:38:32,063 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-08 08:38:32,063 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-08 08:38:32,063 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-08 08:38:32,063 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-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {20444#true} assume 4368 == #t~mem54;havoc #t~mem54; {20444#true} is VALID [2022-04-08 08:38:32,064 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-08 08:38:32,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {20444#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20444#true} is VALID [2022-04-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-08 08:38:32,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,064 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-08 08:38:32,065 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-08 08:38:32,065 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-08 08:38:32,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {20444#true} assume 4384 == #t~mem56;havoc #t~mem56; {20444#true} is VALID [2022-04-08 08:38:32,065 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-08 08:38:32,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {20444#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {20444#true} is VALID [2022-04-08 08:38:32,065 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-08 08:38:32,065 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-08 08:38:32,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {20444#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {20444#true} is VALID [2022-04-08 08:38:32,065 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-08 08:38:32,065 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-08 08:38:32,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {20444#true} ~skip~0 := 0; {20444#true} is VALID [2022-04-08 08:38:32,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {20444#true} assume !false; {20444#true} is VALID [2022-04-08 08:38:32,065 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-08 08:38:32,065 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-08 08:38:32,065 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-08 08:38:32,065 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-08 08:38:32,065 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-08 08:38:32,066 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-08 08:38:32,066 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-08 08:38:32,066 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-08 08:38:32,066 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-08 08:38:32,066 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-08 08:38:32,066 INFO L290 TraceCheckUtils]: 69: Hoare triple {20444#true} assume 4400 == #t~mem58;havoc #t~mem58; {20444#true} is VALID [2022-04-08 08:38:32,066 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-08 08:38:32,066 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-08 08:38:32,071 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-08 08:38:32,071 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-08 08:38:32,072 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-08 08:38:32,072 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-08 08:38:32,072 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-08 08:38:32,072 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-08 08:38:32,073 INFO L290 TraceCheckUtils]: 78: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {20449#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:38:32,073 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-08 08:38:32,073 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-08 08:38:32,073 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-08 08:38:32,074 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-08 08:38:32,074 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-08 08:38:32,074 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-08 08:38:32,074 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-08 08:38:32,075 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-08 08:38:32,075 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-08 08:38:32,075 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-08 08:38:32,075 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-08 08:38:32,076 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-08 08:38:32,076 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-08 08:38:32,076 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-08 08:38:32,076 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-08 08:38:32,076 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-08 08:38:32,077 INFO L290 TraceCheckUtils]: 95: Hoare triple {20449#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {20445#false} is VALID [2022-04-08 08:38:32,077 INFO L290 TraceCheckUtils]: 96: Hoare triple {20445#false} assume !false; {20445#false} is VALID [2022-04-08 08:38:32,077 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-08 08:38:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:32,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456069995] [2022-04-08 08:38:32,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456069995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:32,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:32,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:32,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672011096] [2022-04-08 08:38:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672011096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:32,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:32,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782325170] [2022-04-08 08:38:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:32,078 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-08 08:38:32,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:32,079 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-08 08:38:32,130 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-08 08:38:32,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:38:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:38:32,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:38:32,131 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-08 08:38:34,149 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-08 08:38:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:35,376 INFO L93 Difference]: Finished difference Result 840 states and 1228 transitions. [2022-04-08 08:38:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:38:35,376 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-08 08:38:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:35,376 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-08 08:38:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 08:38:35,378 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-08 08:38:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-04-08 08:38:35,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 488 transitions. [2022-04-08 08:38:35,706 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-08 08:38:35,718 INFO L225 Difference]: With dead ends: 840 [2022-04-08 08:38:35,718 INFO L226 Difference]: Without dead ends: 550 [2022-04-08 08:38:35,719 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-08 08:38:35,720 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-08 08:38:35,720 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-08 08:38:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-04-08 08:38:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-04-08 08:38:35,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:35,736 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-08 08:38:35,737 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-08 08:38:35,738 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-08 08:38:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:35,749 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-08 08:38:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-08 08:38:35,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:35,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:35,751 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-08 08:38:35,752 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-08 08:38:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:35,762 INFO L93 Difference]: Finished difference Result 550 states and 799 transitions. [2022-04-08 08:38:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-08 08:38:35,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:35,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:35,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:35,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:35,763 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-08 08:38:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 799 transitions. [2022-04-08 08:38:35,776 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 799 transitions. Word has length 97 [2022-04-08 08:38:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:35,777 INFO L478 AbstractCegarLoop]: Abstraction has 550 states and 799 transitions. [2022-04-08 08:38:35,777 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-08 08:38:35,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 550 states and 799 transitions. [2022-04-08 08:38:36,396 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-08 08:38:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2022-04-08 08:38:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 08:38:36,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:36,399 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-08 08:38:36,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:38:36,399 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 1 times [2022-04-08 08:38:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:36,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979492273] [2022-04-08 08:38:36,400 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1108655063, now seen corresponding path program 2 times [2022-04-08 08:38:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:36,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694386195] [2022-04-08 08:38:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:36,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:36,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:36,694 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-08 08:38:36,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-08 08:38:36,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-08 08:38:36,695 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-08 08:38:36,695 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-08 08:38:36,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {24333#true} assume true; {24333#true} is VALID [2022-04-08 08:38:36,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24333#true} {24333#true} #593#return; {24333#true} is VALID [2022-04-08 08:38:36,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {24333#true} call #t~ret158 := main(); {24333#true} is VALID [2022-04-08 08:38:36,695 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-08 08:38:36,696 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-08 08:38:36,696 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-08 08:38:36,696 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-08 08:38:36,696 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-08 08:38:36,696 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-08 08:38:36,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-08 08:38:36,696 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-08 08:38:36,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {24333#true} assume 12292 == #t~mem49;havoc #t~mem49; {24333#true} is VALID [2022-04-08 08:38:36,696 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-08 08:38:36,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {24333#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {24333#true} is VALID [2022-04-08 08:38:36,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {24333#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24333#true} is VALID [2022-04-08 08:38:36,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {24333#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {24333#true} is VALID [2022-04-08 08:38:36,696 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-08 08:38:36,696 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-08 08:38:36,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {24333#true} assume !(0 == ~tmp___4~0); {24333#true} is VALID [2022-04-08 08:38:36,696 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-08 08:38:36,696 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-08 08:38:36,697 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-08 08:38:36,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-08 08:38:36,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-08 08:38:36,697 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-08 08:38:36,697 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-08 08:38:36,697 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-08 08:38:36,697 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-08 08:38:36,697 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-08 08:38:36,697 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-08 08:38:36,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {24333#true} assume 4368 == #t~mem54;havoc #t~mem54; {24333#true} is VALID [2022-04-08 08:38:36,703 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-08 08:38:36,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {24333#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24333#true} is VALID [2022-04-08 08:38:36,703 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-08 08:38:36,703 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-08 08:38:36,703 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-08 08:38:36,703 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-08 08:38:36,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-08 08:38:36,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-08 08:38:36,703 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-08 08:38:36,703 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-08 08:38:36,703 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-08 08:38:36,703 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-08 08:38:36,704 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-08 08:38:36,704 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-08 08:38:36,704 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-08 08:38:36,704 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-08 08:38:36,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {24333#true} assume 4384 == #t~mem56;havoc #t~mem56; {24333#true} is VALID [2022-04-08 08:38:36,704 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-08 08:38:36,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {24333#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {24333#true} is VALID [2022-04-08 08:38:36,704 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-08 08:38:36,704 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-08 08:38:36,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {24333#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {24333#true} is VALID [2022-04-08 08:38:36,704 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-08 08:38:36,704 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-08 08:38:36,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-08 08:38:36,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-08 08:38:36,704 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-08 08:38:36,704 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-08 08:38:36,704 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-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {24333#true} assume 4400 == #t~mem58;havoc #t~mem58; {24333#true} is VALID [2022-04-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {24333#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {24333#true} is VALID [2022-04-08 08:38:36,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {24333#true} assume !(~ret~0 <= 0); {24333#true} is VALID [2022-04-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 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-08 08:38:36,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {24333#true} ~skip~0 := 0; {24333#true} is VALID [2022-04-08 08:38:36,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {24333#true} assume !false; {24333#true} is VALID [2022-04-08 08:38:36,705 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 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-08 08:38:36,706 INFO L290 TraceCheckUtils]: 91: Hoare triple {24333#true} assume 4416 == #t~mem60;havoc #t~mem60; {24333#true} is VALID [2022-04-08 08:38:36,706 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-08 08:38:36,707 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-08 08:38:36,707 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-08 08:38:36,707 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-08 08:38:36,707 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-08 08:38:36,708 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-08 08:38:36,708 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-08 08:38:36,708 INFO L290 TraceCheckUtils]: 99: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume !false; {24338#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:38:36,708 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-08 08:38:36,709 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-08 08:38:36,709 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-08 08:38:36,709 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-08 08:38:36,709 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-08 08:38:36,709 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-08 08:38:36,710 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-08 08:38:36,710 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-08 08:38:36,710 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-08 08:38:36,710 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-08 08:38:36,711 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-08 08:38:36,711 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-08 08:38:36,711 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-08 08:38:36,711 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-08 08:38:36,712 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-08 08:38:36,712 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-08 08:38:36,712 INFO L290 TraceCheckUtils]: 116: Hoare triple {24338#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {24334#false} is VALID [2022-04-08 08:38:36,712 INFO L290 TraceCheckUtils]: 117: Hoare triple {24334#false} assume !false; {24334#false} is VALID [2022-04-08 08:38:36,713 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-08 08:38:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:36,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694386195] [2022-04-08 08:38:36,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694386195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:36,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:36,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:36,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:38:36,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979492273] [2022-04-08 08:38:36,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979492273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:38:36,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:38:36,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:38:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088869997] [2022-04-08 08:38:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:38:36,714 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-08 08:38:36,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:38:36,714 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-08 08:38:36,787 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-08 08:38:36,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:38:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:38:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:38:36,789 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-08 08:38:38,805 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-08 08:38:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:39,904 INFO L93 Difference]: Finished difference Result 1103 states and 1611 transitions. [2022-04-08 08:38:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:38:39,904 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-08 08:38:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:38:39,921 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-08 08:38:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 08:38:39,923 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-08 08:38:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 08:38:39,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-08 08:38:40,176 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-08 08:38:40,211 INFO L225 Difference]: With dead ends: 1103 [2022-04-08 08:38:40,211 INFO L226 Difference]: Without dead ends: 682 [2022-04-08 08:38:40,212 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-08 08:38:40,213 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-08 08:38:40,213 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-08 08:38:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-08 08:38:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2022-04-08 08:38:40,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:38:40,265 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-08 08:38:40,265 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-08 08:38:40,266 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-08 08:38:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:40,283 INFO L93 Difference]: Finished difference Result 682 states and 991 transitions. [2022-04-08 08:38:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-08 08:38:40,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:40,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:40,286 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-08 08:38:40,286 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-08 08:38:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:38:40,302 INFO L93 Difference]: Finished difference Result 682 states and 991 transitions. [2022-04-08 08:38:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-08 08:38:40,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:38:40,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:38:40,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:38:40,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:38:40,304 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-08 08:38:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 991 transitions. [2022-04-08 08:38:40,323 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 991 transitions. Word has length 118 [2022-04-08 08:38:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:38:40,323 INFO L478 AbstractCegarLoop]: Abstraction has 682 states and 991 transitions. [2022-04-08 08:38:40,323 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-08 08:38:40,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 682 states and 991 transitions. [2022-04-08 08:38:40,855 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-08 08:38:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2022-04-08 08:38:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-08 08:38:40,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:38:40,857 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-08 08:38:40,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:38:40,857 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:38:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:38:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1826850427, now seen corresponding path program 1 times [2022-04-08 08:38:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:38:40,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960217932] [2022-04-08 08:38:53,506 WARN L232 SmtUtils]: Spent 9.14s 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-08 08:39:01,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1826850427, now seen corresponding path program 2 times [2022-04-08 08:39:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169447018] [2022-04-08 08:39:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:01,442 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-08 08:39:01,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {29276#true} assume true; {29276#true} is VALID [2022-04-08 08:39:01,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29276#true} {29276#true} #593#return; {29276#true} is VALID [2022-04-08 08:39:01,442 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-08 08:39:01,443 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-08 08:39:01,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {29276#true} assume true; {29276#true} is VALID [2022-04-08 08:39:01,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29276#true} {29276#true} #593#return; {29276#true} is VALID [2022-04-08 08:39:01,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {29276#true} call #t~ret158 := main(); {29276#true} is VALID [2022-04-08 08:39:01,443 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-08 08:39:01,443 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-08 08:39:01,443 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-08 08:39:01,443 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-08 08:39:01,443 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-08 08:39:01,443 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-08 08:39:01,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-08 08:39:01,443 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-08 08:39:01,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {29276#true} assume 12292 == #t~mem49;havoc #t~mem49; {29276#true} is VALID [2022-04-08 08:39:01,443 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-08 08:39:01,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {29276#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {29276#true} is VALID [2022-04-08 08:39:01,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {29276#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {29276#true} is VALID [2022-04-08 08:39:01,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {29276#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {29276#true} is VALID [2022-04-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {29276#true} assume !(0 == ~tmp___4~0); {29276#true} is VALID [2022-04-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {29276#true} ~skip~0 := 0; {29276#true} is VALID [2022-04-08 08:39:01,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 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-08 08:39:01,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {29276#true} assume 4368 == #t~mem54;havoc #t~mem54; {29276#true} is VALID [2022-04-08 08:39:01,444 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-08 08:39:01,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {29276#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29276#true} is VALID [2022-04-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {29276#true} ~skip~0 := 0; {29276#true} is VALID [2022-04-08 08:39:01,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {29276#true} assume !false; {29276#true} is VALID [2022-04-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 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-08 08:39:01,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {29276#true} assume 4384 == #t~mem56;havoc #t~mem56; {29276#true} is VALID [2022-04-08 08:39:01,445 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-08 08:39:01,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {29276#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29276#true} is VALID [2022-04-08 08:39:01,445 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-08 08:39:01,446 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-08 08:39:01,447 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-08 08:39:01,447 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-08 08:39:01,447 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-08 08:39:01,447 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-08 08:39:01,448 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-08 08:39:01,448 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-08 08:39:01,448 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-08 08:39:01,448 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-08 08:39:01,449 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-08 08:39:01,449 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-08 08:39:01,449 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-08 08:39:01,449 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-08 08:39:01,450 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-08 08:39:01,450 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-08 08:39:01,450 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-08 08:39:01,450 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {29277#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {29277#false} is VALID [2022-04-08 08:39:01,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {29277#false} assume !(~ret~0 <= 0); {29277#false} is VALID [2022-04-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-08 08:39:01,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,451 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-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,452 INFO L290 TraceCheckUtils]: 91: Hoare triple {29277#false} assume 4416 == #t~mem60;havoc #t~mem60; {29277#false} is VALID [2022-04-08 08:39:01,452 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-08 08:39:01,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {29277#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29277#false} is VALID [2022-04-08 08:39:01,452 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-08 08:39:01,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {29277#false} assume !(0 == ~tmp___6~0); {29277#false} is VALID [2022-04-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,452 INFO L290 TraceCheckUtils]: 98: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-08 08:39:01,452 INFO L290 TraceCheckUtils]: 99: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,452 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-08 08:39:01,453 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-08 08:39:01,453 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-08 08:39:01,453 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-08 08:39:01,453 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-08 08:39:01,453 INFO L290 TraceCheckUtils]: 110: Hoare triple {29277#false} assume 4400 == #t~mem58;havoc #t~mem58; {29277#false} is VALID [2022-04-08 08:39:01,453 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-08 08:39:01,453 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-08 08:39:01,453 INFO L290 TraceCheckUtils]: 113: Hoare triple {29277#false} assume !(2 == ~blastFlag~0); {29277#false} is VALID [2022-04-08 08:39:01,453 INFO L290 TraceCheckUtils]: 114: Hoare triple {29277#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {29277#false} is VALID [2022-04-08 08:39:01,453 INFO L290 TraceCheckUtils]: 115: Hoare triple {29277#false} assume !(~ret~0 <= 0); {29277#false} is VALID [2022-04-08 08:39:01,453 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-08 08:39:01,453 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-08 08:39:01,453 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-08 08:39:01,453 INFO L290 TraceCheckUtils]: 119: Hoare triple {29277#false} ~skip~0 := 0; {29277#false} is VALID [2022-04-08 08:39:01,453 INFO L290 TraceCheckUtils]: 120: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-08 08:39:01,453 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-08 08:39:01,453 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 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-08 08:39:01,454 INFO L290 TraceCheckUtils]: 135: Hoare triple {29277#false} assume 4432 == #t~mem62;havoc #t~mem62; {29277#false} is VALID [2022-04-08 08:39:01,454 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-08 08:39:01,454 INFO L290 TraceCheckUtils]: 137: Hoare triple {29277#false} assume 5 == ~blastFlag~0; {29277#false} is VALID [2022-04-08 08:39:01,454 INFO L290 TraceCheckUtils]: 138: Hoare triple {29277#false} assume !false; {29277#false} is VALID [2022-04-08 08:39:01,455 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-08 08:39:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:01,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169447018] [2022-04-08 08:39:01,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169447018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:01,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:01,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:01,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:01,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960217932] [2022-04-08 08:39:01,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960217932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:01,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:01,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:01,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090110961] [2022-04-08 08:39:01,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:01,456 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-08 08:39:01,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:01,456 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-08 08:39:01,526 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-08 08:39:01,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:01,527 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-08 08:39:03,546 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-08 08:39:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:04,595 INFO L93 Difference]: Finished difference Result 1802 states and 2631 transitions. [2022-04-08 08:39:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:04,595 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-08 08:39:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:04,596 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-08 08:39:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:39:04,598 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-08 08:39:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:39:04,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 08:39:04,908 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-08 08:39:04,957 INFO L225 Difference]: With dead ends: 1802 [2022-04-08 08:39:04,957 INFO L226 Difference]: Without dead ends: 1136 [2022-04-08 08:39:04,958 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-08 08:39:04,959 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-08 08:39:04,959 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-08 08:39:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-04-08 08:39:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 787. [2022-04-08 08:39:04,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:04,983 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-08 08:39:04,984 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-08 08:39:04,984 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-08 08:39:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:05,021 INFO L93 Difference]: Finished difference Result 1136 states and 1655 transitions. [2022-04-08 08:39:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1655 transitions. [2022-04-08 08:39:05,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:05,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:05,023 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-08 08:39:05,024 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-08 08:39:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:05,059 INFO L93 Difference]: Finished difference Result 1136 states and 1655 transitions. [2022-04-08 08:39:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1655 transitions. [2022-04-08 08:39:05,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:05,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:05,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:05,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:05,062 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-08 08:39:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1156 transitions. [2022-04-08 08:39:05,087 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1156 transitions. Word has length 139 [2022-04-08 08:39:05,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:05,087 INFO L478 AbstractCegarLoop]: Abstraction has 787 states and 1156 transitions. [2022-04-08 08:39:05,087 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-08 08:39:05,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 787 states and 1156 transitions. [2022-04-08 08:39:05,721 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-08 08:39:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1156 transitions. [2022-04-08 08:39:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-08 08:39:05,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:05,723 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-08 08:39:05,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:39:05,723 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1784272250, now seen corresponding path program 1 times [2022-04-08 08:39:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:05,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588883819] [2022-04-08 08:39:19,119 WARN L232 SmtUtils]: Spent 9.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-08 08:39:28,200 WARN L232 SmtUtils]: Spent 5.05s 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-08 08:39:30,192 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1784272250, now seen corresponding path program 2 times [2022-04-08 08:39:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:30,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146531181] [2022-04-08 08:39:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:30,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:30,355 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-08 08:39:30,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {36738#true} assume true; {36738#true} is VALID [2022-04-08 08:39:30,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36738#true} {36738#true} #593#return; {36738#true} is VALID [2022-04-08 08:39:30,356 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-08 08:39:30,356 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-08 08:39:30,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {36738#true} assume true; {36738#true} is VALID [2022-04-08 08:39:30,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36738#true} {36738#true} #593#return; {36738#true} is VALID [2022-04-08 08:39:30,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {36738#true} call #t~ret158 := main(); {36738#true} is VALID [2022-04-08 08:39:30,356 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-08 08:39:30,357 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-08 08:39:30,357 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-08 08:39:30,357 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-08 08:39:30,357 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-08 08:39:30,357 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-08 08:39:30,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-08 08:39:30,357 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-08 08:39:30,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {36738#true} assume 12292 == #t~mem49;havoc #t~mem49; {36738#true} is VALID [2022-04-08 08:39:30,357 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-08 08:39:30,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {36738#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {36738#true} is VALID [2022-04-08 08:39:30,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {36738#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36738#true} is VALID [2022-04-08 08:39:30,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {36738#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {36738#true} is VALID [2022-04-08 08:39:30,357 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-08 08:39:30,357 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-08 08:39:30,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {36738#true} assume !(0 == ~tmp___4~0); {36738#true} is VALID [2022-04-08 08:39:30,357 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-08 08:39:30,357 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-08 08:39:30,358 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-08 08:39:30,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-08 08:39:30,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {36738#true} assume 4368 == #t~mem54;havoc #t~mem54; {36738#true} is VALID [2022-04-08 08:39:30,358 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-08 08:39:30,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {36738#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36738#true} is VALID [2022-04-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 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-08 08:39:30,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-08 08:39:30,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {36738#true} assume 4384 == #t~mem56;havoc #t~mem56; {36738#true} is VALID [2022-04-08 08:39:30,359 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-08 08:39:30,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {36738#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {36738#true} is VALID [2022-04-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {36738#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36738#true} is VALID [2022-04-08 08:39:30,359 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-08 08:39:30,359 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-08 08:39:30,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-08 08:39:30,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 INFO L290 TraceCheckUtils]: 69: Hoare triple {36738#true} assume 4400 == #t~mem58;havoc #t~mem58; {36738#true} is VALID [2022-04-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,360 INFO L290 TraceCheckUtils]: 72: Hoare triple {36738#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {36738#true} is VALID [2022-04-08 08:39:30,360 INFO L290 TraceCheckUtils]: 73: Hoare triple {36738#true} assume !(~ret~0 <= 0); {36738#true} is VALID [2022-04-08 08:39:30,360 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-08 08:39:30,360 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-08 08:39:30,361 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-08 08:39:30,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {36738#true} ~skip~0 := 0; {36738#true} is VALID [2022-04-08 08:39:30,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {36738#true} assume !false; {36738#true} is VALID [2022-04-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 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-08 08:39:30,361 INFO L290 TraceCheckUtils]: 91: Hoare triple {36738#true} assume 4416 == #t~mem60;havoc #t~mem60; {36738#true} is VALID [2022-04-08 08:39:30,361 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-08 08:39:30,361 INFO L290 TraceCheckUtils]: 93: Hoare triple {36738#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {36738#true} is VALID [2022-04-08 08:39:30,362 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-08 08:39:30,363 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-08 08:39:30,363 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-08 08:39:30,363 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-08 08:39:30,363 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-08 08:39:30,363 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-08 08:39:30,364 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-08 08:39:30,364 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-08 08:39:30,364 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-08 08:39:30,364 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-08 08:39:30,365 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-08 08:39:30,365 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-08 08:39:30,365 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-08 08:39:30,365 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-08 08:39:30,365 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-08 08:39:30,366 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-08 08:39:30,366 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-08 08:39:30,366 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-08 08:39:30,366 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-08 08:39:30,366 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-08 08:39:30,366 INFO L290 TraceCheckUtils]: 114: Hoare triple {36739#false} assume !(2 == ~blastFlag~0); {36739#false} is VALID [2022-04-08 08:39:30,367 INFO L290 TraceCheckUtils]: 115: Hoare triple {36739#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {36739#false} is VALID [2022-04-08 08:39:30,367 INFO L290 TraceCheckUtils]: 116: Hoare triple {36739#false} assume !(~ret~0 <= 0); {36739#false} is VALID [2022-04-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 INFO L290 TraceCheckUtils]: 120: Hoare triple {36739#false} ~skip~0 := 0; {36739#false} is VALID [2022-04-08 08:39:30,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {36739#false} assume !false; {36739#false} is VALID [2022-04-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,367 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-08 08:39:30,368 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-08 08:39:30,368 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-08 08:39:30,368 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-08 08:39:30,368 INFO L290 TraceCheckUtils]: 136: Hoare triple {36739#false} assume 4432 == #t~mem62;havoc #t~mem62; {36739#false} is VALID [2022-04-08 08:39:30,368 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-08 08:39:30,368 INFO L290 TraceCheckUtils]: 138: Hoare triple {36739#false} assume 5 == ~blastFlag~0; {36739#false} is VALID [2022-04-08 08:39:30,368 INFO L290 TraceCheckUtils]: 139: Hoare triple {36739#false} assume !false; {36739#false} is VALID [2022-04-08 08:39:30,368 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-08 08:39:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:30,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146531181] [2022-04-08 08:39:30,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146531181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:30,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:30,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:30,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588883819] [2022-04-08 08:39:30,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588883819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:30,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:30,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370166695] [2022-04-08 08:39:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:30,369 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-08 08:39:30,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:30,370 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-08 08:39:30,442 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-08 08:39:30,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:30,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:30,443 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-08 08:39:32,465 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-08 08:39:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:33,763 INFO L93 Difference]: Finished difference Result 1896 states and 2793 transitions. [2022-04-08 08:39:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:39:33,763 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-08 08:39:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:39:33,763 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-08 08:39:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-08 08:39:33,765 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-08 08:39:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 462 transitions. [2022-04-08 08:39:33,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 462 transitions. [2022-04-08 08:39:33,969 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-08 08:39:34,014 INFO L225 Difference]: With dead ends: 1896 [2022-04-08 08:39:34,014 INFO L226 Difference]: Without dead ends: 1125 [2022-04-08 08:39:34,015 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-08 08:39:34,016 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-08 08:39:34,016 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-08 08:39:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-04-08 08:39:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 871. [2022-04-08 08:39:34,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:39:34,042 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-08 08:39:34,043 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-08 08:39:34,043 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-08 08:39:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:34,078 INFO L93 Difference]: Finished difference Result 1125 states and 1653 transitions. [2022-04-08 08:39:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1653 transitions. [2022-04-08 08:39:34,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:34,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:34,081 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-08 08:39:34,081 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-08 08:39:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:39:34,116 INFO L93 Difference]: Finished difference Result 1125 states and 1653 transitions. [2022-04-08 08:39:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1653 transitions. [2022-04-08 08:39:34,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:39:34,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:39:34,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:39:34,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:39:34,119 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-08 08:39:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1288 transitions. [2022-04-08 08:39:34,148 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1288 transitions. Word has length 140 [2022-04-08 08:39:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:39:34,149 INFO L478 AbstractCegarLoop]: Abstraction has 871 states and 1288 transitions. [2022-04-08 08:39:34,149 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-08 08:39:34,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1288 transitions. [2022-04-08 08:39:34,964 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-08 08:39:34,964 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1288 transitions. [2022-04-08 08:39:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-08 08:39:34,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:39:34,966 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-08 08:39:34,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:39:34,966 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:39:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:39:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1065118499, now seen corresponding path program 1 times [2022-04-08 08:39:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:34,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046846421] [2022-04-08 08:39:46,733 WARN L232 SmtUtils]: Spent 11.41s 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-08 08:39:58,600 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:39:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1065118499, now seen corresponding path program 2 times [2022-04-08 08:39:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:39:58,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62133363] [2022-04-08 08:39:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:39:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:39:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:58,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:39:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:39:58,795 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-08 08:39:58,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {44534#true} assume true; {44534#true} is VALID [2022-04-08 08:39:58,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44534#true} {44534#true} #593#return; {44534#true} is VALID [2022-04-08 08:39:58,796 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-08 08:39:58,796 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-08 08:39:58,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {44534#true} assume true; {44534#true} is VALID [2022-04-08 08:39:58,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44534#true} {44534#true} #593#return; {44534#true} is VALID [2022-04-08 08:39:58,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {44534#true} call #t~ret158 := main(); {44534#true} is VALID [2022-04-08 08:39:58,797 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-08 08:39:58,797 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-08 08:39:58,797 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-08 08:39:58,797 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-08 08:39:58,797 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-08 08:39:58,797 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-08 08:39:58,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-08 08:39:58,797 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-08 08:39:58,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {44534#true} assume 12292 == #t~mem49;havoc #t~mem49; {44534#true} is VALID [2022-04-08 08:39:58,797 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-08 08:39:58,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {44534#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44534#true} is VALID [2022-04-08 08:39:58,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {44534#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44534#true} is VALID [2022-04-08 08:39:58,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {44534#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44534#true} is VALID [2022-04-08 08:39:58,797 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-08 08:39:58,797 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-08 08:39:58,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {44534#true} assume !(0 == ~tmp___4~0); {44534#true} is VALID [2022-04-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-08 08:39:58,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {44534#true} assume 4368 == #t~mem54;havoc #t~mem54; {44534#true} is VALID [2022-04-08 08:39:58,798 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-08 08:39:58,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {44534#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44534#true} is VALID [2022-04-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,798 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-08 08:39:58,799 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-08 08:39:58,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-08 08:39:58,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {44534#true} assume 4384 == #t~mem56;havoc #t~mem56; {44534#true} is VALID [2022-04-08 08:39:58,799 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-08 08:39:58,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {44534#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44534#true} is VALID [2022-04-08 08:39:58,799 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-08 08:39:58,799 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-08 08:39:58,799 INFO L290 TraceCheckUtils]: 54: Hoare triple {44534#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44534#true} is VALID [2022-04-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-08 08:39:58,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {44534#true} assume 4400 == #t~mem58;havoc #t~mem58; {44534#true} is VALID [2022-04-08 08:39:58,800 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-08 08:39:58,800 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-08 08:39:58,801 INFO L290 TraceCheckUtils]: 72: Hoare triple {44534#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {44534#true} is VALID [2022-04-08 08:39:58,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {44534#true} assume !(~ret~0 <= 0); {44534#true} is VALID [2022-04-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {44534#true} ~skip~0 := 0; {44534#true} is VALID [2022-04-08 08:39:58,801 INFO L290 TraceCheckUtils]: 78: Hoare triple {44534#true} assume !false; {44534#true} is VALID [2022-04-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,801 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-08 08:39:58,802 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-08 08:39:58,802 INFO L290 TraceCheckUtils]: 91: Hoare triple {44534#true} assume 4416 == #t~mem60;havoc #t~mem60; {44534#true} is VALID [2022-04-08 08:39:58,802 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-08 08:39:58,802 INFO L290 TraceCheckUtils]: 93: Hoare triple {44534#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {44534#true} is VALID [2022-04-08 08:39:58,802 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-08 08:39:58,803 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-08 08:39:58,803 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-08 08:39:58,819 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-08 08:39:58,819 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-08 08:39:58,820 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-08 08:39:58,820 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-08 08:39:58,820 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-08 08:39:58,821 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-08 08:39:58,821 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-08 08:39:58,821 INFO L290 TraceCheckUtils]: 104: Hoare triple {44535#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {44535#false} is VALID [2022-04-08 08:39:58,821 INFO L290 TraceCheckUtils]: 105: Hoare triple {44535#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44535#false} is VALID [2022-04-08 08:39:58,821 INFO L290 TraceCheckUtils]: 106: Hoare triple {44535#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {44535#false} is VALID [2022-04-08 08:39:58,821 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-08 08:39:58,821 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-08 08:39:58,821 INFO L290 TraceCheckUtils]: 109: Hoare triple {44535#false} assume !(0 == ~tmp___4~0); {44535#false} is VALID [2022-04-08 08:39:58,821 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-08 08:39:58,821 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-08 08:39:58,821 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-08 08:39:58,822 INFO L290 TraceCheckUtils]: 113: Hoare triple {44535#false} ~skip~0 := 0; {44535#false} is VALID [2022-04-08 08:39:58,822 INFO L290 TraceCheckUtils]: 114: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 INFO L290 TraceCheckUtils]: 126: Hoare triple {44535#false} assume 4401 == #t~mem59;havoc #t~mem59; {44535#false} is VALID [2022-04-08 08:39:58,822 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-08 08:39:58,822 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-08 08:39:58,822 INFO L290 TraceCheckUtils]: 129: Hoare triple {44535#false} assume !(2 == ~blastFlag~0); {44535#false} is VALID [2022-04-08 08:39:58,822 INFO L290 TraceCheckUtils]: 130: Hoare triple {44535#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {44535#false} is VALID [2022-04-08 08:39:58,823 INFO L290 TraceCheckUtils]: 131: Hoare triple {44535#false} assume !(~ret~0 <= 0); {44535#false} is VALID [2022-04-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 INFO L290 TraceCheckUtils]: 135: Hoare triple {44535#false} ~skip~0 := 0; {44535#false} is VALID [2022-04-08 08:39:58,823 INFO L290 TraceCheckUtils]: 136: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,823 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-08 08:39:58,824 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-08 08:39:58,824 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-08 08:39:58,824 INFO L290 TraceCheckUtils]: 151: Hoare triple {44535#false} assume 4432 == #t~mem62;havoc #t~mem62; {44535#false} is VALID [2022-04-08 08:39:58,824 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-08 08:39:58,824 INFO L290 TraceCheckUtils]: 153: Hoare triple {44535#false} assume 5 == ~blastFlag~0; {44535#false} is VALID [2022-04-08 08:39:58,824 INFO L290 TraceCheckUtils]: 154: Hoare triple {44535#false} assume !false; {44535#false} is VALID [2022-04-08 08:39:58,824 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-08 08:39:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:39:58,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62133363] [2022-04-08 08:39:58,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62133363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:58,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:58,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:58,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:39:58,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046846421] [2022-04-08 08:39:58,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046846421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:39:58,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:39:58,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:39:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871222838] [2022-04-08 08:39:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:39:58,825 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-08 08:39:58,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:39:58,826 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-08 08:39:58,896 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-08 08:39:58,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:39:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:39:58,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:39:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:39:58,896 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-08 08:40:00,916 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-08 08:40:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:02,358 INFO L93 Difference]: Finished difference Result 1980 states and 2921 transitions. [2022-04-08 08:40:02,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:02,358 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-08 08:40:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:02,359 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-08 08:40:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:40:02,361 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-08 08:40:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-08 08:40:02,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-08 08:40:02,655 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-08 08:40:02,702 INFO L225 Difference]: With dead ends: 1980 [2022-04-08 08:40:02,702 INFO L226 Difference]: Without dead ends: 1125 [2022-04-08 08:40:02,721 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-08 08:40:02,722 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:02,722 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.5s Time] [2022-04-08 08:40:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-04-08 08:40:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 871. [2022-04-08 08:40:02,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:02,755 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-08 08:40:02,756 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-08 08:40:02,756 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-08 08:40:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:02,792 INFO L93 Difference]: Finished difference Result 1125 states and 1649 transitions. [2022-04-08 08:40:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1649 transitions. [2022-04-08 08:40:02,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:02,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:02,794 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-08 08:40:02,795 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-08 08:40:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:02,830 INFO L93 Difference]: Finished difference Result 1125 states and 1649 transitions. [2022-04-08 08:40:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1649 transitions. [2022-04-08 08:40:02,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:02,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:02,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:02,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:02,832 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-08 08:40:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1284 transitions. [2022-04-08 08:40:02,862 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1284 transitions. Word has length 155 [2022-04-08 08:40:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:02,863 INFO L478 AbstractCegarLoop]: Abstraction has 871 states and 1284 transitions. [2022-04-08 08:40:02,863 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-08 08:40:02,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 871 states and 1284 transitions. [2022-04-08 08:40:03,904 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-08 08:40:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1284 transitions. [2022-04-08 08:40:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-08 08:40:03,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:03,905 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-08 08:40:03,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:40:03,906 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1761005295, now seen corresponding path program 1 times [2022-04-08 08:40:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:03,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910374699] [2022-04-08 08:40:20,014 WARN L232 SmtUtils]: Spent 11.36s 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-08 08:40:28,846 WARN L232 SmtUtils]: Spent 5.10s 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-08 08:40:30,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1761005295, now seen corresponding path program 2 times [2022-04-08 08:40:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:30,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024780880] [2022-04-08 08:40:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:30,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:30,916 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-08 08:40:30,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {52498#true} assume true; {52498#true} is VALID [2022-04-08 08:40:30,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52498#true} {52498#true} #593#return; {52498#true} is VALID [2022-04-08 08:40:30,917 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-08 08:40:30,917 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-08 08:40:30,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {52498#true} assume true; {52498#true} is VALID [2022-04-08 08:40:30,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52498#true} {52498#true} #593#return; {52498#true} is VALID [2022-04-08 08:40:30,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {52498#true} call #t~ret158 := main(); {52498#true} is VALID [2022-04-08 08:40:30,917 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-08 08:40:30,917 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-08 08:40:30,917 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-08 08:40:30,917 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-08 08:40:30,917 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-08 08:40:30,918 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-08 08:40:30,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-08 08:40:30,918 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-08 08:40:30,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {52498#true} assume 12292 == #t~mem49;havoc #t~mem49; {52498#true} is VALID [2022-04-08 08:40:30,918 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-08 08:40:30,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {52498#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52498#true} is VALID [2022-04-08 08:40:30,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {52498#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52498#true} is VALID [2022-04-08 08:40:30,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {52498#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52498#true} is VALID [2022-04-08 08:40:30,918 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-08 08:40:30,918 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-08 08:40:30,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {52498#true} assume !(0 == ~tmp___4~0); {52498#true} is VALID [2022-04-08 08:40:30,918 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-08 08:40:30,918 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-08 08:40:30,918 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-08 08:40:30,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-08 08:40:30,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-08 08:40:30,918 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {52498#true} assume 4368 == #t~mem54;havoc #t~mem54; {52498#true} is VALID [2022-04-08 08:40:30,919 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-08 08:40:30,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {52498#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52498#true} is VALID [2022-04-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-08 08:40:30,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,919 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-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {52498#true} assume 4384 == #t~mem56;havoc #t~mem56; {52498#true} is VALID [2022-04-08 08:40:30,920 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-08 08:40:30,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {52498#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52498#true} is VALID [2022-04-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {52498#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52498#true} is VALID [2022-04-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-08 08:40:30,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,920 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-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 INFO L290 TraceCheckUtils]: 69: Hoare triple {52498#true} assume 4400 == #t~mem58;havoc #t~mem58; {52498#true} is VALID [2022-04-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 INFO L290 TraceCheckUtils]: 72: Hoare triple {52498#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {52498#true} is VALID [2022-04-08 08:40:30,921 INFO L290 TraceCheckUtils]: 73: Hoare triple {52498#true} assume !(~ret~0 <= 0); {52498#true} is VALID [2022-04-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,921 INFO L290 TraceCheckUtils]: 77: Hoare triple {52498#true} ~skip~0 := 0; {52498#true} is VALID [2022-04-08 08:40:30,921 INFO L290 TraceCheckUtils]: 78: Hoare triple {52498#true} assume !false; {52498#true} is VALID [2022-04-08 08:40:30,921 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-08 08:40:30,921 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 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-08 08:40:30,922 INFO L290 TraceCheckUtils]: 91: Hoare triple {52498#true} assume 4416 == #t~mem60;havoc #t~mem60; {52498#true} is VALID [2022-04-08 08:40:30,922 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-08 08:40:30,922 INFO L290 TraceCheckUtils]: 93: Hoare triple {52498#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52498#true} is VALID [2022-04-08 08:40:30,923 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-08 08:40:30,924 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-08 08:40:30,924 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-08 08:40:30,924 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-08 08:40:30,924 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-08 08:40:30,925 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-08 08:40:30,925 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-08 08:40:30,925 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-08 08:40:30,926 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-08 08:40:30,926 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-08 08:40:30,926 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-08 08:40:30,926 INFO L290 TraceCheckUtils]: 105: Hoare triple {52499#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {52499#false} is VALID [2022-04-08 08:40:30,927 INFO L290 TraceCheckUtils]: 106: Hoare triple {52499#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52499#false} is VALID [2022-04-08 08:40:30,927 INFO L290 TraceCheckUtils]: 107: Hoare triple {52499#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {52499#false} is VALID [2022-04-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 INFO L290 TraceCheckUtils]: 110: Hoare triple {52499#false} assume !(0 == ~tmp___4~0); {52499#false} is VALID [2022-04-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 INFO L290 TraceCheckUtils]: 114: Hoare triple {52499#false} ~skip~0 := 0; {52499#false} is VALID [2022-04-08 08:40:30,927 INFO L290 TraceCheckUtils]: 115: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,927 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-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,928 INFO L290 TraceCheckUtils]: 127: Hoare triple {52499#false} assume 4401 == #t~mem59;havoc #t~mem59; {52499#false} is VALID [2022-04-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,928 INFO L290 TraceCheckUtils]: 130: Hoare triple {52499#false} assume !(2 == ~blastFlag~0); {52499#false} is VALID [2022-04-08 08:40:30,928 INFO L290 TraceCheckUtils]: 131: Hoare triple {52499#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {52499#false} is VALID [2022-04-08 08:40:30,928 INFO L290 TraceCheckUtils]: 132: Hoare triple {52499#false} assume !(~ret~0 <= 0); {52499#false} is VALID [2022-04-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,928 INFO L290 TraceCheckUtils]: 136: Hoare triple {52499#false} ~skip~0 := 0; {52499#false} is VALID [2022-04-08 08:40:30,928 INFO L290 TraceCheckUtils]: 137: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,928 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 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-08 08:40:30,929 INFO L290 TraceCheckUtils]: 152: Hoare triple {52499#false} assume 4432 == #t~mem62;havoc #t~mem62; {52499#false} is VALID [2022-04-08 08:40:30,929 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-08 08:40:30,929 INFO L290 TraceCheckUtils]: 154: Hoare triple {52499#false} assume 5 == ~blastFlag~0; {52499#false} is VALID [2022-04-08 08:40:30,929 INFO L290 TraceCheckUtils]: 155: Hoare triple {52499#false} assume !false; {52499#false} is VALID [2022-04-08 08:40:30,930 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-08 08:40:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:30,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024780880] [2022-04-08 08:40:30,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024780880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:30,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:30,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:30,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:30,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910374699] [2022-04-08 08:40:30,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910374699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:30,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:30,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:30,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909101337] [2022-04-08 08:40:30,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:30,931 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-08 08:40:30,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:30,931 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-08 08:40:31,019 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-08 08:40:31,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:31,020 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-08 08:40:33,042 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-08 08:40:34,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:34,137 INFO L93 Difference]: Finished difference Result 2115 states and 3127 transitions. [2022-04-08 08:40:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:34,137 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-08 08:40:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:34,137 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-08 08:40:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:40:34,141 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-08 08:40:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:40:34,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 08:40:34,460 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-08 08:40:34,520 INFO L225 Difference]: With dead ends: 2115 [2022-04-08 08:40:34,520 INFO L226 Difference]: Without dead ends: 1260 [2022-04-08 08:40:34,521 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-08 08:40:34,521 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-08 08:40:34,522 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-08 08:40:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-08 08:40:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 881. [2022-04-08 08:40:34,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:34,557 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-08 08:40:34,558 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-08 08:40:34,558 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-08 08:40:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:34,612 INFO L93 Difference]: Finished difference Result 1260 states and 1849 transitions. [2022-04-08 08:40:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1849 transitions. [2022-04-08 08:40:34,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:34,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:34,614 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-08 08:40:34,615 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-08 08:40:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:34,657 INFO L93 Difference]: Finished difference Result 1260 states and 1849 transitions. [2022-04-08 08:40:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1849 transitions. [2022-04-08 08:40:34,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:34,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:34,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:34,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:34,659 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-08 08:40:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1290 transitions. [2022-04-08 08:40:34,690 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1290 transitions. Word has length 156 [2022-04-08 08:40:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:34,690 INFO L478 AbstractCegarLoop]: Abstraction has 881 states and 1290 transitions. [2022-04-08 08:40:34,690 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-08 08:40:34,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 881 states and 1290 transitions. [2022-04-08 08:40:35,809 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-08 08:40:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1290 transitions. [2022-04-08 08:40:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-08 08:40:35,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:35,811 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-08 08:40:35,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:40:35,811 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1272587528, now seen corresponding path program 1 times [2022-04-08 08:40:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:35,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492551547] [2022-04-08 08:40:50,186 WARN L232 SmtUtils]: Spent 9.38s 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-08 08:40:58,086 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1272587528, now seen corresponding path program 2 times [2022-04-08 08:40:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327683177] [2022-04-08 08:40:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:58,278 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-08 08:40:58,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {61022#true} assume true; {61022#true} is VALID [2022-04-08 08:40:58,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61022#true} {61022#true} #593#return; {61022#true} is VALID [2022-04-08 08:40:58,279 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-08 08:40:58,279 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-08 08:40:58,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {61022#true} assume true; {61022#true} is VALID [2022-04-08 08:40:58,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61022#true} {61022#true} #593#return; {61022#true} is VALID [2022-04-08 08:40:58,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {61022#true} call #t~ret158 := main(); {61022#true} is VALID [2022-04-08 08:40:58,280 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-08 08:40:58,280 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-08 08:40:58,280 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-08 08:40:58,280 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-08 08:40:58,280 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-08 08:40:58,280 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-08 08:40:58,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-08 08:40:58,280 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-08 08:40:58,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {61022#true} assume 12292 == #t~mem49;havoc #t~mem49; {61022#true} is VALID [2022-04-08 08:40:58,280 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-08 08:40:58,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {61022#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61022#true} is VALID [2022-04-08 08:40:58,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {61022#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61022#true} is VALID [2022-04-08 08:40:58,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {61022#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {61022#true} is VALID [2022-04-08 08:40:58,280 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-08 08:40:58,280 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-08 08:40:58,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {61022#true} assume !(0 == ~tmp___4~0); {61022#true} is VALID [2022-04-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-08 08:40:58,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {61022#true} assume 4368 == #t~mem54;havoc #t~mem54; {61022#true} is VALID [2022-04-08 08:40:58,281 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-08 08:40:58,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {61022#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61022#true} is VALID [2022-04-08 08:40:58,281 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-08 08:40:58,281 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-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-08 08:40:58,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {61022#true} assume 4384 == #t~mem56;havoc #t~mem56; {61022#true} is VALID [2022-04-08 08:40:58,282 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-08 08:40:58,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {61022#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61022#true} is VALID [2022-04-08 08:40:58,282 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-08 08:40:58,282 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-08 08:40:58,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {61022#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61022#true} is VALID [2022-04-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-08 08:40:58,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 INFO L290 TraceCheckUtils]: 69: Hoare triple {61022#true} assume 4400 == #t~mem58;havoc #t~mem58; {61022#true} is VALID [2022-04-08 08:40:58,283 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-08 08:40:58,283 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-08 08:40:58,283 INFO L290 TraceCheckUtils]: 72: Hoare triple {61022#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {61022#true} is VALID [2022-04-08 08:40:58,284 INFO L290 TraceCheckUtils]: 73: Hoare triple {61022#true} assume !(~ret~0 <= 0); {61022#true} is VALID [2022-04-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {61022#true} ~skip~0 := 0; {61022#true} is VALID [2022-04-08 08:40:58,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {61022#true} assume !false; {61022#true} is VALID [2022-04-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,284 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-08 08:40:58,285 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-08 08:40:58,285 INFO L290 TraceCheckUtils]: 91: Hoare triple {61022#true} assume 4416 == #t~mem60;havoc #t~mem60; {61022#true} is VALID [2022-04-08 08:40:58,285 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-08 08:40:58,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {61022#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {61022#true} is VALID [2022-04-08 08:40:58,286 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-08 08:40:58,286 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-08 08:40:58,286 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-08 08:40:58,286 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-08 08:40:58,287 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-08 08:40:58,287 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-08 08:40:58,287 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-08 08:40:58,287 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-08 08:40:58,288 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-08 08:40:58,288 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-08 08:40:58,288 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-08 08:40:58,288 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-08 08:40:58,289 INFO L290 TraceCheckUtils]: 106: Hoare triple {61023#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61023#false} is VALID [2022-04-08 08:40:58,289 INFO L290 TraceCheckUtils]: 107: Hoare triple {61023#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61023#false} is VALID [2022-04-08 08:40:58,289 INFO L290 TraceCheckUtils]: 108: Hoare triple {61023#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {61023#false} is VALID [2022-04-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,289 INFO L290 TraceCheckUtils]: 111: Hoare triple {61023#false} assume !(0 == ~tmp___4~0); {61023#false} is VALID [2022-04-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,289 INFO L290 TraceCheckUtils]: 115: Hoare triple {61023#false} ~skip~0 := 0; {61023#false} is VALID [2022-04-08 08:40:58,289 INFO L290 TraceCheckUtils]: 116: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,289 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-08 08:40:58,290 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-08 08:40:58,290 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-08 08:40:58,290 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-08 08:40:58,290 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-08 08:40:58,290 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-08 08:40:58,290 INFO L290 TraceCheckUtils]: 128: Hoare triple {61023#false} assume 4401 == #t~mem59;havoc #t~mem59; {61023#false} is VALID [2022-04-08 08:40:58,290 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-08 08:40:58,290 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-08 08:40:58,290 INFO L290 TraceCheckUtils]: 131: Hoare triple {61023#false} assume !(2 == ~blastFlag~0); {61023#false} is VALID [2022-04-08 08:40:58,290 INFO L290 TraceCheckUtils]: 132: Hoare triple {61023#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {61023#false} is VALID [2022-04-08 08:40:58,290 INFO L290 TraceCheckUtils]: 133: Hoare triple {61023#false} assume !(~ret~0 <= 0); {61023#false} is VALID [2022-04-08 08:40:58,290 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-08 08:40:58,290 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-08 08:40:58,290 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-08 08:40:58,290 INFO L290 TraceCheckUtils]: 137: Hoare triple {61023#false} ~skip~0 := 0; {61023#false} is VALID [2022-04-08 08:40:58,290 INFO L290 TraceCheckUtils]: 138: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-08 08:40:58,290 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 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-08 08:40:58,291 INFO L290 TraceCheckUtils]: 153: Hoare triple {61023#false} assume 4432 == #t~mem62;havoc #t~mem62; {61023#false} is VALID [2022-04-08 08:40:58,291 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-08 08:40:58,291 INFO L290 TraceCheckUtils]: 155: Hoare triple {61023#false} assume 5 == ~blastFlag~0; {61023#false} is VALID [2022-04-08 08:40:58,291 INFO L290 TraceCheckUtils]: 156: Hoare triple {61023#false} assume !false; {61023#false} is VALID [2022-04-08 08:40:58,292 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-08 08:40:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:58,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327683177] [2022-04-08 08:40:58,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327683177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:58,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:58,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:58,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:58,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [492551547] [2022-04-08 08:40:58,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [492551547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:58,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:58,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:58,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670609469] [2022-04-08 08:40:58,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:58,293 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-08 08:40:58,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:58,293 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-08 08:40:58,364 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-08 08:40:58,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:58,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:58,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:58,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:58,365 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-08 08:41:00,386 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-08 08:41:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:01,416 INFO L93 Difference]: Finished difference Result 2125 states and 3119 transitions. [2022-04-08 08:41:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:01,416 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-08 08:41:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:01,417 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-08 08:41:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 08:41:01,418 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-08 08:41:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-08 08:41:01,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-08 08:41:01,623 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-08 08:41:01,689 INFO L225 Difference]: With dead ends: 2125 [2022-04-08 08:41:01,689 INFO L226 Difference]: Without dead ends: 1260 [2022-04-08 08:41:01,708 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-08 08:41:01,709 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-08 08:41:01,709 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-08 08:41:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-08 08:41:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 886. [2022-04-08 08:41:01,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:01,749 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-08 08:41:01,749 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-08 08:41:01,750 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-08 08:41:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:01,792 INFO L93 Difference]: Finished difference Result 1260 states and 1835 transitions. [2022-04-08 08:41:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1835 transitions. [2022-04-08 08:41:01,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:01,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:01,794 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-08 08:41:01,795 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-08 08:41:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:01,836 INFO L93 Difference]: Finished difference Result 1260 states and 1835 transitions. [2022-04-08 08:41:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1835 transitions. [2022-04-08 08:41:01,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:01,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:01,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:01,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:01,838 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-08 08:41:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1286 transitions. [2022-04-08 08:41:01,868 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1286 transitions. Word has length 157 [2022-04-08 08:41:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:01,868 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1286 transitions. [2022-04-08 08:41:01,868 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-08 08:41:01,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1286 transitions. [2022-04-08 08:41:02,997 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-08 08:41:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1286 transitions. [2022-04-08 08:41:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-08 08:41:02,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:02,999 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-08 08:41:02,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:41:02,999 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1472512973, now seen corresponding path program 1 times [2022-04-08 08:41:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:03,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1736663399] [2022-04-08 08:41:15,171 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-08 08:41:22,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1472512973, now seen corresponding path program 2 times [2022-04-08 08:41:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:22,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915675947] [2022-04-08 08:41:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:22,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:22,854 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-08 08:41:22,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {69576#true} assume true; {69576#true} is VALID [2022-04-08 08:41:22,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69576#true} {69576#true} #593#return; {69576#true} is VALID [2022-04-08 08:41:22,855 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-08 08:41:22,855 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-08 08:41:22,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {69576#true} assume true; {69576#true} is VALID [2022-04-08 08:41:22,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69576#true} {69576#true} #593#return; {69576#true} is VALID [2022-04-08 08:41:22,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {69576#true} call #t~ret158 := main(); {69576#true} is VALID [2022-04-08 08:41:22,856 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-08 08:41:22,856 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-08 08:41:22,856 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-08 08:41:22,856 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-08 08:41:22,856 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-08 08:41:22,856 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-08 08:41:22,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-08 08:41:22,856 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-08 08:41:22,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {69576#true} assume 12292 == #t~mem49;havoc #t~mem49; {69576#true} is VALID [2022-04-08 08:41:22,856 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-08 08:41:22,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {69576#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {69576#true} is VALID [2022-04-08 08:41:22,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {69576#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {69576#true} is VALID [2022-04-08 08:41:22,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {69576#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {69576#true} is VALID [2022-04-08 08:41:22,856 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-08 08:41:22,856 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-08 08:41:22,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {69576#true} assume !(0 == ~tmp___4~0); {69576#true} is VALID [2022-04-08 08:41:22,856 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-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-08 08:41:22,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {69576#true} assume 4368 == #t~mem54;havoc #t~mem54; {69576#true} is VALID [2022-04-08 08:41:22,857 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-08 08:41:22,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {69576#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {69576#true} is VALID [2022-04-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 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-08 08:41:22,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-08 08:41:22,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {69576#true} assume 4384 == #t~mem56;havoc #t~mem56; {69576#true} is VALID [2022-04-08 08:41:22,858 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-08 08:41:22,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {69576#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {69576#true} is VALID [2022-04-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {69576#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {69576#true} is VALID [2022-04-08 08:41:22,858 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-08 08:41:22,858 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-08 08:41:22,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-08 08:41:22,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {69576#true} assume 4400 == #t~mem58;havoc #t~mem58; {69576#true} is VALID [2022-04-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {69576#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {69576#true} is VALID [2022-04-08 08:41:22,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {69576#true} assume !(~ret~0 <= 0); {69576#true} is VALID [2022-04-08 08:41:22,859 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-08 08:41:22,859 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-08 08:41:22,860 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-08 08:41:22,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {69576#true} ~skip~0 := 0; {69576#true} is VALID [2022-04-08 08:41:22,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {69576#true} assume !false; {69576#true} is VALID [2022-04-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 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-08 08:41:22,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {69576#true} assume 4416 == #t~mem60;havoc #t~mem60; {69576#true} is VALID [2022-04-08 08:41:22,860 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-08 08:41:22,860 INFO L290 TraceCheckUtils]: 93: Hoare triple {69576#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {69576#true} is VALID [2022-04-08 08:41:22,861 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-08 08:41:22,862 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-08 08:41:22,862 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-08 08:41:22,862 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-08 08:41:22,862 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-08 08:41:22,863 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-08 08:41:22,863 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-08 08:41:22,863 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-08 08:41:22,863 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-08 08:41:22,864 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-08 08:41:22,864 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-08 08:41:22,864 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-08 08:41:22,864 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-08 08:41:22,865 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-08 08:41:22,865 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-08 08:41:22,865 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-08 08:41:22,865 INFO L290 TraceCheckUtils]: 110: Hoare triple {69577#false} assume !(1 == ~blastFlag~0); {69577#false} is VALID [2022-04-08 08:41:22,865 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-08 08:41:22,865 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-08 08:41:22,865 INFO L290 TraceCheckUtils]: 113: Hoare triple {69577#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {69577#false} is VALID [2022-04-08 08:41:22,865 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-08 08:41:22,865 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-08 08:41:22,865 INFO L290 TraceCheckUtils]: 116: Hoare triple {69577#false} ~skip~0 := 0; {69577#false} is VALID [2022-04-08 08:41:22,865 INFO L290 TraceCheckUtils]: 117: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 INFO L290 TraceCheckUtils]: 128: Hoare triple {69577#false} assume 4400 == #t~mem58;havoc #t~mem58; {69577#false} is VALID [2022-04-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 INFO L290 TraceCheckUtils]: 131: Hoare triple {69577#false} assume !(2 == ~blastFlag~0); {69577#false} is VALID [2022-04-08 08:41:22,866 INFO L290 TraceCheckUtils]: 132: Hoare triple {69577#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {69577#false} is VALID [2022-04-08 08:41:22,866 INFO L290 TraceCheckUtils]: 133: Hoare triple {69577#false} assume !(~ret~0 <= 0); {69577#false} is VALID [2022-04-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,866 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-08 08:41:22,867 INFO L290 TraceCheckUtils]: 137: Hoare triple {69577#false} ~skip~0 := 0; {69577#false} is VALID [2022-04-08 08:41:22,867 INFO L290 TraceCheckUtils]: 138: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 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-08 08:41:22,867 INFO L290 TraceCheckUtils]: 153: Hoare triple {69577#false} assume 4432 == #t~mem62;havoc #t~mem62; {69577#false} is VALID [2022-04-08 08:41:22,867 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-08 08:41:22,868 INFO L290 TraceCheckUtils]: 155: Hoare triple {69577#false} assume 5 == ~blastFlag~0; {69577#false} is VALID [2022-04-08 08:41:22,868 INFO L290 TraceCheckUtils]: 156: Hoare triple {69577#false} assume !false; {69577#false} is VALID [2022-04-08 08:41:22,868 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-08 08:41:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:22,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915675947] [2022-04-08 08:41:22,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915675947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:22,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:22,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:22,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:22,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1736663399] [2022-04-08 08:41:22,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1736663399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:22,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:22,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575762185] [2022-04-08 08:41:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:22,869 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-08 08:41:22,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:22,870 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-08 08:41:22,943 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-08 08:41:22,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:22,944 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-08 08:41:24,970 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-08 08:41:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:26,294 INFO L93 Difference]: Finished difference Result 1974 states and 2873 transitions. [2022-04-08 08:41:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:26,294 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-08 08:41:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:26,295 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-08 08:41:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-04-08 08:41:26,298 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-08 08:41:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2022-04-08 08:41:26,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 447 transitions. [2022-04-08 08:41:26,594 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-08 08:41:26,638 INFO L225 Difference]: With dead ends: 1974 [2022-04-08 08:41:26,638 INFO L226 Difference]: Without dead ends: 1104 [2022-04-08 08:41:26,639 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-08 08:41:26,639 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-08 08:41:26,639 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-08 08:41:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-04-08 08:41:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 886. [2022-04-08 08:41:26,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:26,676 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-08 08:41:26,677 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-08 08:41:26,678 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-08 08:41:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:26,711 INFO L93 Difference]: Finished difference Result 1104 states and 1603 transitions. [2022-04-08 08:41:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1603 transitions. [2022-04-08 08:41:26,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:26,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:26,713 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-08 08:41:26,714 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-08 08:41:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:26,747 INFO L93 Difference]: Finished difference Result 1104 states and 1603 transitions. [2022-04-08 08:41:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1603 transitions. [2022-04-08 08:41:26,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:26,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:26,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:26,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:26,749 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-08 08:41:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1282 transitions. [2022-04-08 08:41:26,779 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1282 transitions. Word has length 157 [2022-04-08 08:41:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:26,780 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1282 transitions. [2022-04-08 08:41:26,780 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-08 08:41:26,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1282 transitions. [2022-04-08 08:41:27,774 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-08 08:41:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1282 transitions. [2022-04-08 08:41:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-08 08:41:27,775 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:27,775 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-08 08:41:27,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:41:27,776 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1600786980, now seen corresponding path program 1 times [2022-04-08 08:41:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:27,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038926248] [2022-04-08 08:41:40,162 WARN L232 SmtUtils]: Spent 9.21s 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-08 08:41:48,117 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1600786980, now seen corresponding path program 2 times [2022-04-08 08:41:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:48,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608203455] [2022-04-08 08:41:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:48,302 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-08 08:41:48,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {77516#true} assume true; {77516#true} is VALID [2022-04-08 08:41:48,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77516#true} {77516#true} #593#return; {77516#true} is VALID [2022-04-08 08:41:48,303 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-08 08:41:48,303 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-08 08:41:48,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {77516#true} assume true; {77516#true} is VALID [2022-04-08 08:41:48,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77516#true} {77516#true} #593#return; {77516#true} is VALID [2022-04-08 08:41:48,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {77516#true} call #t~ret158 := main(); {77516#true} is VALID [2022-04-08 08:41:48,303 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-08 08:41:48,303 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-08 08:41:48,303 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-08 08:41:48,303 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-08 08:41:48,304 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-08 08:41:48,304 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-08 08:41:48,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-08 08:41:48,304 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-08 08:41:48,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {77516#true} assume 12292 == #t~mem49;havoc #t~mem49; {77516#true} is VALID [2022-04-08 08:41:48,304 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-08 08:41:48,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {77516#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {77516#true} is VALID [2022-04-08 08:41:48,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {77516#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {77516#true} is VALID [2022-04-08 08:41:48,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {77516#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {77516#true} is VALID [2022-04-08 08:41:48,304 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-08 08:41:48,304 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-08 08:41:48,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {77516#true} assume !(0 == ~tmp___4~0); {77516#true} is VALID [2022-04-08 08:41:48,304 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-08 08:41:48,304 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-08 08:41:48,304 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-08 08:41:48,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-08 08:41:48,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-08 08:41:48,304 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {77516#true} assume 4368 == #t~mem54;havoc #t~mem54; {77516#true} is VALID [2022-04-08 08:41:48,305 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-08 08:41:48,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {77516#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {77516#true} is VALID [2022-04-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-08 08:41:48,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,305 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-08 08:41:48,306 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-08 08:41:48,306 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-08 08:41:48,306 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-08 08:41:48,306 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-08 08:41:48,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {77516#true} assume 4384 == #t~mem56;havoc #t~mem56; {77516#true} is VALID [2022-04-08 08:41:48,307 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-08 08:41:48,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {77516#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {77516#true} is VALID [2022-04-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 INFO L290 TraceCheckUtils]: 54: Hoare triple {77516#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77516#true} is VALID [2022-04-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-08 08:41:48,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,307 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-08 08:41:48,308 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-08 08:41:48,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {77516#true} assume 4400 == #t~mem58;havoc #t~mem58; {77516#true} is VALID [2022-04-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {77516#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {77516#true} is VALID [2022-04-08 08:41:48,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {77516#true} assume !(~ret~0 <= 0); {77516#true} is VALID [2022-04-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {77516#true} ~skip~0 := 0; {77516#true} is VALID [2022-04-08 08:41:48,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {77516#true} assume !false; {77516#true} is VALID [2022-04-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,308 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-08 08:41:48,309 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-08 08:41:48,309 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-08 08:41:48,309 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-08 08:41:48,309 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-08 08:41:48,309 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-08 08:41:48,309 INFO L290 TraceCheckUtils]: 91: Hoare triple {77516#true} assume 4416 == #t~mem60;havoc #t~mem60; {77516#true} is VALID [2022-04-08 08:41:48,309 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-08 08:41:48,309 INFO L290 TraceCheckUtils]: 93: Hoare triple {77516#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {77516#true} is VALID [2022-04-08 08:41:48,310 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-08 08:41:48,310 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-08 08:41:48,310 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-08 08:41:48,311 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-08 08:41:48,311 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-08 08:41:48,311 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-08 08:41:48,311 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-08 08:41:48,311 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-08 08:41:48,312 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-08 08:41:48,312 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-08 08:41:48,312 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-08 08:41:48,312 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-08 08:41:48,313 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-08 08:41:48,313 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-08 08:41:48,313 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-08 08:41:48,313 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-08 08:41:48,313 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-08 08:41:48,314 INFO L290 TraceCheckUtils]: 111: Hoare triple {77517#false} assume !(1 == ~blastFlag~0); {77517#false} is VALID [2022-04-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 INFO L290 TraceCheckUtils]: 114: Hoare triple {77517#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {77517#false} is VALID [2022-04-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 INFO L290 TraceCheckUtils]: 117: Hoare triple {77517#false} ~skip~0 := 0; {77517#false} is VALID [2022-04-08 08:41:48,314 INFO L290 TraceCheckUtils]: 118: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,314 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-08 08:41:48,315 INFO L290 TraceCheckUtils]: 129: Hoare triple {77517#false} assume 4400 == #t~mem58;havoc #t~mem58; {77517#false} is VALID [2022-04-08 08:41:48,315 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-08 08:41:48,315 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-08 08:41:48,315 INFO L290 TraceCheckUtils]: 132: Hoare triple {77517#false} assume !(2 == ~blastFlag~0); {77517#false} is VALID [2022-04-08 08:41:48,315 INFO L290 TraceCheckUtils]: 133: Hoare triple {77517#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {77517#false} is VALID [2022-04-08 08:41:48,315 INFO L290 TraceCheckUtils]: 134: Hoare triple {77517#false} assume !(~ret~0 <= 0); {77517#false} is VALID [2022-04-08 08:41:48,315 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-08 08:41:48,315 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-08 08:41:48,315 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-08 08:41:48,315 INFO L290 TraceCheckUtils]: 138: Hoare triple {77517#false} ~skip~0 := 0; {77517#false} is VALID [2022-04-08 08:41:48,316 INFO L290 TraceCheckUtils]: 139: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 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-08 08:41:48,316 INFO L290 TraceCheckUtils]: 154: Hoare triple {77517#false} assume 4432 == #t~mem62;havoc #t~mem62; {77517#false} is VALID [2022-04-08 08:41:48,316 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-08 08:41:48,316 INFO L290 TraceCheckUtils]: 156: Hoare triple {77517#false} assume 5 == ~blastFlag~0; {77517#false} is VALID [2022-04-08 08:41:48,316 INFO L290 TraceCheckUtils]: 157: Hoare triple {77517#false} assume !false; {77517#false} is VALID [2022-04-08 08:41:48,317 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-08 08:41:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:48,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608203455] [2022-04-08 08:41:48,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608203455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:48,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:48,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:48,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:48,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038926248] [2022-04-08 08:41:48,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038926248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:48,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:48,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831904916] [2022-04-08 08:41:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:48,318 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-08 08:41:48,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:48,320 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-08 08:41:48,401 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-08 08:41:48,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:48,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:48,402 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-08 08:41:50,422 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-08 08:41:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:51,773 INFO L93 Difference]: Finished difference Result 1958 states and 2844 transitions. [2022-04-08 08:41:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:51,774 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-08 08:41:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:51,775 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-08 08:41:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:41:51,776 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-08 08:41:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:41:51,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 08:41:52,031 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-08 08:41:52,074 INFO L225 Difference]: With dead ends: 1958 [2022-04-08 08:41:52,074 INFO L226 Difference]: Without dead ends: 1088 [2022-04-08 08:41:52,076 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-08 08:41:52,076 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-08 08:41:52,076 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-08 08:41:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2022-04-08 08:41:52,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 886. [2022-04-08 08:41:52,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:52,113 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-08 08:41:52,113 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-08 08:41:52,114 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-08 08:41:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:52,146 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2022-04-08 08:41:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1578 transitions. [2022-04-08 08:41:52,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:52,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:52,147 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-08 08:41:52,148 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-08 08:41:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:52,180 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2022-04-08 08:41:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1578 transitions. [2022-04-08 08:41:52,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:52,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:52,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:52,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:52,181 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-08 08:41:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1278 transitions. [2022-04-08 08:41:52,211 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1278 transitions. Word has length 158 [2022-04-08 08:41:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:52,212 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1278 transitions. [2022-04-08 08:41:52,212 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-08 08:41:52,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 1278 transitions. [2022-04-08 08:41:53,375 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-08 08:41:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1278 transitions. [2022-04-08 08:41:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-08 08:41:53,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:53,377 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-08 08:41:53,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:41:53,377 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:53,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash -500107939, now seen corresponding path program 1 times [2022-04-08 08:41:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:53,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36244676] [2022-04-08 08:42:06,278 WARN L232 SmtUtils]: Spent 9.42s 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-08 08:42:13,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash -500107939, now seen corresponding path program 2 times [2022-04-08 08:42:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:13,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198514616] [2022-04-08 08:42:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:14,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:14,245 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-08 08:42:14,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-08 08:42:14,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-08 08:42:14,246 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-08 08:42:14,246 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-08 08:42:14,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-08 08:42:14,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-08 08:42:14,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-08 08:42:14,246 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-08 08:42:14,246 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-08 08:42:14,248 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-08 08:42:14,248 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-08 08:42:14,248 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-08 08:42:14,248 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-08 08:42:14,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:14,248 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-08 08:42:14,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-08 08:42:14,248 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-08 08:42:14,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:14,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-08 08:42:14,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:14,248 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-08 08:42:14,248 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-08 08:42:14,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-08 08:42:14,248 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-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:14,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-08 08:42:14,249 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-08 08:42:14,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 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-08 08:42:14,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:14,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:14,250 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-08 08:42:14,250 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-08 08:42:14,250 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-08 08:42:14,259 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-08 08:42:14,260 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-08 08:42:14,260 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-08 08:42:14,260 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-08 08:42:14,260 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-08 08:42:14,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-08 08:42:14,260 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-08 08:42:14,260 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-08 08:42:14,260 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-08 08:42:14,260 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-08 08:42:14,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:14,260 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-08 08:42:14,260 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-08 08:42:14,260 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:14,260 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:14,260 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-08 08:42:14,260 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-08 08:42:14,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 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-08 08:42:14,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:14,261 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:14,261 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,262 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-08 08:42:14,262 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-08 08:42:14,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-08 08:42:14,262 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-08 08:42:14,262 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-08 08:42:14,262 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-08 08:42:14,262 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-08 08:42:14,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:14,263 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,263 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-08 08:42:14,264 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-08 08:42:14,264 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-08 08:42:14,264 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-08 08:42:14,264 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-08 08:42:14,264 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-08 08:42:14,265 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:14,265 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 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-08 08:42:14,265 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-08 08:42:14,266 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-08 08:42:14,266 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-08 08:42:14,266 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-08 08:42:14,266 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-08 08:42:14,266 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-08 08:42:14,267 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-08 08:42:14,267 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-08 08:42:14,267 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-08 08:42:14,267 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-08 08:42:14,268 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-08 08:42:14,268 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-08 08:42:14,268 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-08 08:42:14,268 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-08 08:42:14,269 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-08 08:42:14,269 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-08 08:42:14,269 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-08 08:42:14,269 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-08 08:42:14,269 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-08 08:42:14,270 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-08 08:42:14,270 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-08 08:42:14,270 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-08 08:42:14,270 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-08 08:42:14,271 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-08 08:42:14,271 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-08 08:42:14,271 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-08 08:42:14,271 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-08 08:42:14,271 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-08 08:42:14,271 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-08 08:42:14,272 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-08 08:42:14,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:14,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198514616] [2022-04-08 08:42:14,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198514616] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:42:14,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263384711] [2022-04-08 08:42:14,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:42:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:42:14,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:42:14,290 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-08 08:42:14,322 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-08 08:42:58,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:42:58,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:42:58,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 08:42:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:59,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:42:59,116 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:42:59,117 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-08 08:42:59,120 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-08 08:42:59,126 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-08 08:42:59,132 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-08 08:42:59,296 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-04-08 08:42:59,296 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-08 08:42:59,307 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-08 08:42:59,321 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-08 08:42:59,363 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:42:59,363 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-08 08:42:59,567 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:42:59,567 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-08 08:42:59,628 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-08 08:42:59,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85392#true} is VALID [2022-04-08 08:42:59,643 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-08 08:42:59,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-08 08:42:59,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-08 08:42:59,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-08 08:42:59,644 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-08 08:42:59,644 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-08 08:42:59,644 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-08 08:42:59,644 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-08 08:42:59,644 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-08 08:42:59,644 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-08 08:42:59,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,644 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-08 08:42:59,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-08 08:42:59,644 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-08 08:42:59,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:59,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-08 08:42:59,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:59,644 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-08 08:42:59,645 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-08 08:42:59,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-08 08:42:59,646 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-08 08:42:59,646 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-08 08:42:59,646 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-08 08:42:59,646 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-08 08:42:59,647 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-08 08:42:59,647 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-08 08:42:59,647 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-08 08:42:59,647 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-08 08:42:59,648 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-08 08:42:59,648 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-08 08:42:59,648 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-08 08:42:59,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-08 08:42:59,648 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-08 08:42:59,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-08 08:42:59,648 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-08 08:42:59,648 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-08 08:42:59,648 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-08 08:42:59,648 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-08 08:42:59,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,648 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-08 08:42:59,648 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-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-08 08:42:59,649 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-08 08:42:59,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,649 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-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-08 08:42:59,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 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-08 08:42:59,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,650 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,650 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-08 08:42:59,651 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-08 08:42:59,651 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-08 08:42:59,651 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-08 08:42:59,651 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-08 08:42:59,651 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-08 08:42:59,651 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-08 08:42:59,652 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,652 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 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-08 08:42:59,652 INFO L290 TraceCheckUtils]: 114: Hoare triple {85392#true} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-08 08:42:59,652 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-08 08:42:59,653 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,653 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 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-08 08:42:59,653 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-08 08:42:59,653 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-08 08:42:59,654 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-08 08:42:59,654 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-08 08:42:59,654 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-08 08:42:59,654 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-08 08:42:59,656 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-08 08:42:59,656 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-08 08:42:59,657 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-08 08:42:59,657 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-08 08:42:59,657 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-08 08:42:59,657 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-08 08:42:59,657 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-08 08:42:59,658 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-08 08:42:59,658 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-08 08:42:59,658 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-08 08:42:59,658 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-08 08:42:59,658 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-08 08:42:59,658 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-08 08:42:59,659 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-08 08:42:59,659 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-08 08:42:59,659 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-08 08:42:59,659 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-08 08:42:59,659 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-08 08:42:59,660 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-08 08:42:59,660 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-08 08:42:59,660 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-08 08:42:59,660 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-08 08:42:59,660 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-08 08:42:59,660 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-08 08:42:59,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:42:59,867 INFO L290 TraceCheckUtils]: 161: Hoare triple {85393#false} assume !false; {85393#false} is VALID [2022-04-08 08:42:59,867 INFO L290 TraceCheckUtils]: 160: Hoare triple {85393#false} assume 5 == ~blastFlag~0; {85393#false} is VALID [2022-04-08 08:42:59,867 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-08 08:42:59,867 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-08 08:42:59,868 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-08 08:42:59,868 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-08 08:42:59,868 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-08 08:42:59,868 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-08 08:42:59,869 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-08 08:42:59,869 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-08 08:42:59,869 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-08 08:42:59,870 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-08 08:42:59,870 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-08 08:42:59,870 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-08 08:42:59,870 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-08 08:42:59,871 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-08 08:42:59,871 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-08 08:42:59,871 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-08 08:42:59,871 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-08 08:42:59,872 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-08 08:42:59,872 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-08 08:42:59,872 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-08 08:42:59,873 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-08 08:42:59,873 INFO L290 TraceCheckUtils]: 138: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-08 08:42:59,873 INFO L290 TraceCheckUtils]: 137: Hoare triple {85392#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {85392#true} is VALID [2022-04-08 08:42:59,873 INFO L290 TraceCheckUtils]: 136: Hoare triple {85392#true} assume !(2 == ~blastFlag~0); {85392#true} is VALID [2022-04-08 08:42:59,873 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-08 08:42:59,873 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-08 08:42:59,873 INFO L290 TraceCheckUtils]: 133: Hoare triple {85392#true} assume 4401 == #t~mem59;havoc #t~mem59; {85392#true} is VALID [2022-04-08 08:42:59,873 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 INFO L290 TraceCheckUtils]: 121: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 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-08 08:42:59,874 INFO L290 TraceCheckUtils]: 116: Hoare triple {85392#true} assume !(5 == ~blastFlag~0); {85392#true} is VALID [2022-04-08 08:42:59,874 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-08 08:42:59,875 INFO L290 TraceCheckUtils]: 114: Hoare triple {85392#true} assume 4432 == #t~mem62;havoc #t~mem62; {85392#true} is VALID [2022-04-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 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-08 08:42:59,875 INFO L290 TraceCheckUtils]: 99: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,875 INFO L290 TraceCheckUtils]: 98: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 INFO L290 TraceCheckUtils]: 95: Hoare triple {85392#true} assume !(0 == ~tmp___6~0); {85392#true} is VALID [2022-04-08 08:42:59,876 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-08 08:42:59,876 INFO L290 TraceCheckUtils]: 93: Hoare triple {85392#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {85392#true} is VALID [2022-04-08 08:42:59,876 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-08 08:42:59,876 INFO L290 TraceCheckUtils]: 91: Hoare triple {85392#true} assume 4416 == #t~mem60;havoc #t~mem60; {85392#true} is VALID [2022-04-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,876 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-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {85392#true} assume !(~ret~0 <= 0); {85392#true} is VALID [2022-04-08 08:42:59,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {85392#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {85392#true} is VALID [2022-04-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {85392#true} assume 4400 == #t~mem58;havoc #t~mem58; {85392#true} is VALID [2022-04-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,877 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-08 08:42:59,878 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-08 08:42:59,878 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-08 08:42:59,878 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-08 08:42:59,878 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-08 08:42:59,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,878 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-08 08:42:59,878 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-08 08:42:59,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {85392#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:59,878 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-08 08:42:59,878 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-08 08:42:59,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {85392#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {85392#true} is VALID [2022-04-08 08:42:59,878 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-08 08:42:59,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {85392#true} assume 4384 == #t~mem56;havoc #t~mem56; {85392#true} is VALID [2022-04-08 08:42:59,878 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-08 08:42:59,878 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-08 08:42:59,878 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {85392#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {85392#true} is VALID [2022-04-08 08:42:59,879 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-08 08:42:59,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {85392#true} assume 4368 == #t~mem54;havoc #t~mem54; {85392#true} is VALID [2022-04-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,879 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-08 08:42:59,880 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-08 08:42:59,880 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-08 08:42:59,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {85392#true} ~skip~0 := 0; {85392#true} is VALID [2022-04-08 08:42:59,880 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-08 08:42:59,880 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-08 08:42:59,880 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-08 08:42:59,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {85392#true} assume !(0 == ~tmp___4~0); {85392#true} is VALID [2022-04-08 08:42:59,880 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-08 08:42:59,880 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-08 08:42:59,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {85392#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:59,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {85392#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {85392#true} is VALID [2022-04-08 08:42:59,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {85392#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {85392#true} is VALID [2022-04-08 08:42:59,880 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-08 08:42:59,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {85392#true} assume 12292 == #t~mem49;havoc #t~mem49; {85392#true} is VALID [2022-04-08 08:42:59,880 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-08 08:42:59,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {85392#true} assume !false; {85392#true} is VALID [2022-04-08 08:42:59,880 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-08 08:42:59,881 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-08 08:42:59,881 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-08 08:42:59,881 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-08 08:42:59,881 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-08 08:42:59,881 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-08 08:42:59,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {85392#true} call #t~ret158 := main(); {85392#true} is VALID [2022-04-08 08:42:59,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85392#true} {85392#true} #593#return; {85392#true} is VALID [2022-04-08 08:42:59,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {85392#true} assume true; {85392#true} is VALID [2022-04-08 08:42:59,881 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-08 08:42:59,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {85392#true} call ULTIMATE.init(); {85392#true} is VALID [2022-04-08 08:42:59,882 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-08 08:42:59,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263384711] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:42:59,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:42:59,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 13 [2022-04-08 08:42:59,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:59,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36244676] [2022-04-08 08:42:59,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36244676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:59,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:59,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:42:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173324567] [2022-04-08 08:42:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:59,885 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-08 08:42:59,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:59,885 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-08 08:42:59,947 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-08 08:42:59,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:42:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:42:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:42:59,948 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-08 08:43:06,016 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-08 08:43:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:07,270 INFO L93 Difference]: Finished difference Result 2234 states and 3239 transitions. [2022-04-08 08:43:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:43:07,270 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-08 08:43:07,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:07,271 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-08 08:43:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-08 08:43:07,273 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-08 08:43:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-08 08:43:07,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 472 transitions. [2022-04-08 08:43:07,598 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-08 08:43:07,663 INFO L225 Difference]: With dead ends: 2234 [2022-04-08 08:43:07,663 INFO L226 Difference]: Without dead ends: 1364 [2022-04-08 08:43:07,664 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-08 08:43:07,665 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-08 08:43:07,665 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-08 08:43:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-04-08 08:43:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1036. [2022-04-08 08:43:07,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:08,000 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-08 08:43:08,001 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-08 08:43:08,002 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-08 08:43:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:08,052 INFO L93 Difference]: Finished difference Result 1364 states and 1976 transitions. [2022-04-08 08:43:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1976 transitions. [2022-04-08 08:43:08,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:08,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:08,054 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-08 08:43:08,055 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-08 08:43:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:08,105 INFO L93 Difference]: Finished difference Result 1364 states and 1976 transitions. [2022-04-08 08:43:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1976 transitions. [2022-04-08 08:43:08,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:08,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:08,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:08,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:08,107 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-08 08:43:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1518 transitions. [2022-04-08 08:43:08,147 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1518 transitions. Word has length 162 [2022-04-08 08:43:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:08,147 INFO L478 AbstractCegarLoop]: Abstraction has 1036 states and 1518 transitions. [2022-04-08 08:43:08,147 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-08 08:43:08,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1036 states and 1518 transitions. [2022-04-08 08:43:09,347 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-08 08:43:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1518 transitions. [2022-04-08 08:43:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 08:43:09,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:09,349 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-08 08:43:09,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 08:43:09,563 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-08 08:43:09,564 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1671837310, now seen corresponding path program 1 times [2022-04-08 08:43:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:09,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637509935] [2022-04-08 08:43:26,559 WARN L232 SmtUtils]: Spent 13.30s 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-08 08:43:35,959 WARN L232 SmtUtils]: Spent 5.18s 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-08 08:43:38,023 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1671837310, now seen corresponding path program 2 times [2022-04-08 08:43:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:38,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392068256] [2022-04-08 08:43:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:38,174 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-08 08:43:38,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {95649#true} assume true; {95649#true} is VALID [2022-04-08 08:43:38,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95649#true} {95649#true} #593#return; {95649#true} is VALID [2022-04-08 08:43:38,174 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-08 08:43:38,175 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-08 08:43:38,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {95649#true} assume true; {95649#true} is VALID [2022-04-08 08:43:38,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95649#true} {95649#true} #593#return; {95649#true} is VALID [2022-04-08 08:43:38,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {95649#true} call #t~ret158 := main(); {95649#true} is VALID [2022-04-08 08:43:38,175 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-08 08:43:38,175 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-08 08:43:38,175 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-08 08:43:38,175 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-08 08:43:38,175 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-08 08:43:38,175 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-08 08:43:38,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-08 08:43:38,175 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-08 08:43:38,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {95649#true} assume 12292 == #t~mem49;havoc #t~mem49; {95649#true} is VALID [2022-04-08 08:43:38,175 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-08 08:43:38,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {95649#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {95649#true} is VALID [2022-04-08 08:43:38,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {95649#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {95649#true} is VALID [2022-04-08 08:43:38,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {95649#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {95649#true} is VALID [2022-04-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {95649#true} assume !(0 == ~tmp___4~0); {95649#true} is VALID [2022-04-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-08 08:43:38,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 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-08 08:43:38,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {95649#true} assume 4368 == #t~mem54;havoc #t~mem54; {95649#true} is VALID [2022-04-08 08:43:38,176 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-08 08:43:38,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {95649#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {95649#true} is VALID [2022-04-08 08:43:38,176 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-08 08:43:38,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {95649#true} assume 4384 == #t~mem56;havoc #t~mem56; {95649#true} is VALID [2022-04-08 08:43:38,177 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-08 08:43:38,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {95649#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {95649#true} is VALID [2022-04-08 08:43:38,177 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-08 08:43:38,177 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-08 08:43:38,177 INFO L290 TraceCheckUtils]: 54: Hoare triple {95649#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {95649#true} is VALID [2022-04-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-08 08:43:38,178 INFO L290 TraceCheckUtils]: 58: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {95649#true} assume 4400 == #t~mem58;havoc #t~mem58; {95649#true} is VALID [2022-04-08 08:43:38,178 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-08 08:43:38,178 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-08 08:43:38,178 INFO L290 TraceCheckUtils]: 72: Hoare triple {95649#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {95649#true} is VALID [2022-04-08 08:43:38,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {95649#true} assume !(~ret~0 <= 0); {95649#true} is VALID [2022-04-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 INFO L290 TraceCheckUtils]: 77: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-08 08:43:38,179 INFO L290 TraceCheckUtils]: 78: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,179 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-08 08:43:38,180 INFO L290 TraceCheckUtils]: 91: Hoare triple {95649#true} assume 4416 == #t~mem60;havoc #t~mem60; {95649#true} is VALID [2022-04-08 08:43:38,180 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-08 08:43:38,180 INFO L290 TraceCheckUtils]: 93: Hoare triple {95649#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {95649#true} is VALID [2022-04-08 08:43:38,180 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-08 08:43:38,180 INFO L290 TraceCheckUtils]: 95: Hoare triple {95649#true} assume !(0 == ~tmp___6~0); {95649#true} is VALID [2022-04-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 INFO L290 TraceCheckUtils]: 98: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-08 08:43:38,180 INFO L290 TraceCheckUtils]: 99: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,180 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 INFO L290 TraceCheckUtils]: 114: Hoare triple {95649#true} assume 4432 == #t~mem62;havoc #t~mem62; {95649#true} is VALID [2022-04-08 08:43:38,181 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-08 08:43:38,181 INFO L290 TraceCheckUtils]: 116: Hoare triple {95649#true} assume !(5 == ~blastFlag~0); {95649#true} is VALID [2022-04-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 INFO L290 TraceCheckUtils]: 120: Hoare triple {95649#true} ~skip~0 := 0; {95649#true} is VALID [2022-04-08 08:43:38,181 INFO L290 TraceCheckUtils]: 121: Hoare triple {95649#true} assume !false; {95649#true} is VALID [2022-04-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,181 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-08 08:43:38,182 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-08 08:43:38,182 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-08 08:43:38,182 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-08 08:43:38,182 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-08 08:43:38,182 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-08 08:43:38,182 INFO L290 TraceCheckUtils]: 133: Hoare triple {95649#true} assume 4401 == #t~mem59;havoc #t~mem59; {95649#true} is VALID [2022-04-08 08:43:38,182 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-08 08:43:38,182 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-08 08:43:38,182 INFO L290 TraceCheckUtils]: 136: Hoare triple {95649#true} assume !(2 == ~blastFlag~0); {95649#true} is VALID [2022-04-08 08:43:38,182 INFO L290 TraceCheckUtils]: 137: Hoare triple {95649#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {95649#true} is VALID [2022-04-08 08:43:38,182 INFO L290 TraceCheckUtils]: 138: Hoare triple {95649#true} assume !(~ret~0 <= 0); {95649#true} is VALID [2022-04-08 08:43:38,183 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-08 08:43:38,183 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-08 08:43:38,184 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-08 08:43:38,184 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-08 08:43:38,184 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-08 08:43:38,185 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-08 08:43:38,185 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-08 08:43:38,185 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-08 08:43:38,186 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-08 08:43:38,186 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-08 08:43:38,186 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-08 08:43:38,187 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-08 08:43:38,187 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-08 08:43:38,187 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-08 08:43:38,187 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-08 08:43:38,188 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-08 08:43:38,188 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-08 08:43:38,188 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-08 08:43:38,188 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-08 08:43:38,189 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-08 08:43:38,189 INFO L290 TraceCheckUtils]: 159: Hoare triple {95650#false} assume 4433 == #t~mem63;havoc #t~mem63; {95650#false} is VALID [2022-04-08 08:43:38,189 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-08 08:43:38,189 INFO L290 TraceCheckUtils]: 161: Hoare triple {95650#false} assume 5 == ~blastFlag~0; {95650#false} is VALID [2022-04-08 08:43:38,189 INFO L290 TraceCheckUtils]: 162: Hoare triple {95650#false} assume !false; {95650#false} is VALID [2022-04-08 08:43:38,189 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-08 08:43:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:38,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392068256] [2022-04-08 08:43:38,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392068256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:38,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:38,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:38,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:38,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637509935] [2022-04-08 08:43:38,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637509935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:38,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:38,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216932950] [2022-04-08 08:43:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:38,191 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-08 08:43:38,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:38,191 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-08 08:43:38,258 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-08 08:43:38,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:38,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:38,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:38,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:38,259 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-08 08:43:40,278 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-08 08:43:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:41,856 INFO L93 Difference]: Finished difference Result 2287 states and 3332 transitions. [2022-04-08 08:43:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:41,857 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-08 08:43:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:41,857 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-08 08:43:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2022-04-08 08:43:41,859 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-08 08:43:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2022-04-08 08:43:41,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 401 transitions. [2022-04-08 08:43:42,137 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-08 08:43:42,194 INFO L225 Difference]: With dead ends: 2287 [2022-04-08 08:43:42,194 INFO L226 Difference]: Without dead ends: 1267 [2022-04-08 08:43:42,195 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-08 08:43:42,211 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-08 08:43:42,211 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-08 08:43:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-04-08 08:43:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1146. [2022-04-08 08:43:42,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:42,592 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-08 08:43:42,592 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-08 08:43:42,593 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-08 08:43:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:42,652 INFO L93 Difference]: Finished difference Result 1267 states and 1829 transitions. [2022-04-08 08:43:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1829 transitions. [2022-04-08 08:43:42,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:42,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:42,654 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-08 08:43:42,655 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-08 08:43:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:42,697 INFO L93 Difference]: Finished difference Result 1267 states and 1829 transitions. [2022-04-08 08:43:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1829 transitions. [2022-04-08 08:43:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:42,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:42,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:42,700 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-08 08:43:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1683 transitions. [2022-04-08 08:43:42,749 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1683 transitions. Word has length 163 [2022-04-08 08:43:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:42,751 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1683 transitions. [2022-04-08 08:43:42,751 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-08 08:43:42,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1683 transitions. [2022-04-08 08:43:44,202 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-08 08:43:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1683 transitions. [2022-04-08 08:43:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-08 08:43:44,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:44,205 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-08 08:43:44,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:43:44,205 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:44,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:44,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1665276355, now seen corresponding path program 1 times [2022-04-08 08:43:44,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:44,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487092895] [2022-04-08 08:43:51,294 WARN L232 SmtUtils]: Spent 6.42s 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-08 08:44:05,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1665276355, now seen corresponding path program 2 times [2022-04-08 08:44:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:05,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491465977] [2022-04-08 08:44:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:05,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:05,206 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-08 08:44:05,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-08 08:44:05,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-08 08:44:05,206 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-08 08:44:05,207 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-08 08:44:05,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-08 08:44:05,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-08 08:44:05,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-08 08:44:05,207 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-08 08:44:05,207 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-08 08:44:05,207 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-08 08:44:05,207 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-08 08:44:05,207 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-08 08:44:05,207 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-08 08:44:05,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:05,207 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-08 08:44:05,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-08 08:44:05,207 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-08 08:44:05,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:05,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-08 08:44:05,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:05,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 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-08 08:44:05,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-08 08:44:05,208 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-08 08:44:05,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-08 08:44:05,208 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:05,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-08 08:44:05,209 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-08 08:44:05,209 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-08 08:44:05,209 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-08 08:44:05,209 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-08 08:44:05,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:05,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-08 08:44:05,210 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-08 08:44:05,210 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-08 08:44:05,210 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-08 08:44:05,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-08 08:44:05,211 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-08 08:44:05,211 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-08 08:44:05,211 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-08 08:44:05,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:05,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:05,211 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-08 08:44:05,211 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-08 08:44:05,211 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-08 08:44:05,212 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-08 08:44:05,212 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-08 08:44:05,212 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-08 08:44:05,213 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-08 08:44:05,213 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-08 08:44:05,213 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-08 08:44:05,213 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-08 08:44:05,214 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-08 08:44:05,214 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-08 08:44:05,214 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-08 08:44:05,214 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-08 08:44:05,214 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-08 08:44:05,214 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-08 08:44:05,214 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-08 08:44:05,214 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-08 08:44:05,215 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-08 08:44:05,215 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:05,215 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 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-08 08:44:05,215 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-08 08:44:05,216 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-08 08:44:05,216 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:05,216 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,216 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-08 08:44:05,217 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-08 08:44:05,217 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-08 08:44:05,217 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-08 08:44:05,217 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-08 08:44:05,217 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-08 08:44:05,217 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-08 08:44:05,218 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-08 08:44:05,218 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-08 08:44:05,218 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-08 08:44:05,219 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-08 08:44:05,219 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-08 08:44:05,219 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-08 08:44:05,219 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-08 08:44:05,220 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-08 08:44:05,220 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-08 08:44:05,220 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-08 08:44:05,220 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-08 08:44:05,220 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-08 08:44:05,220 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-08 08:44:05,220 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-08 08:44:05,220 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-08 08:44:05,220 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-08 08:44:05,221 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,221 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-08 08:44:05,222 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-08 08:44:05,222 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-08 08:44:05,222 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-08 08:44:05,222 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-08 08:44:05,222 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-08 08:44:05,223 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-08 08:44:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:05,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491465977] [2022-04-08 08:44:05,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491465977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:44:05,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951642034] [2022-04-08 08:44:05,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:44:05,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:44:05,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:44:05,224 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-08 08:44:05,225 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-08 08:44:44,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:44:44,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:44:44,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 08:44:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:44,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:44:44,440 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:44:44,441 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-08 08:44:44,444 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-08 08:44:44,448 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-08 08:44:44,454 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-08 08:44:44,557 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-08 08:44:44,559 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-08 08:44:44,601 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:44:44,601 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-08 08:44:44,745 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-08 08:44:44,856 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:44:44,857 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-08 08:44:44,891 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-08 08:44:44,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105061#true} is VALID [2022-04-08 08:44:44,925 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-08 08:44:44,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-08 08:44:44,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-08 08:44:44,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-08 08:44:44,925 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-08 08:44:44,925 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-08 08:44:44,925 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-08 08:44:44,925 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-08 08:44:44,925 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-08 08:44:44,925 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-08 08:44:44,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:44,925 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-08 08:44:44,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-08 08:44:44,925 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-08 08:44:44,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:44,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-08 08:44:44,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:44,926 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-08 08:44:44,926 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-08 08:44:44,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-08 08:44:44,927 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-08 08:44:44,927 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-08 08:44:44,927 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-08 08:44:44,928 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-08 08:44:44,928 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-08 08:44:44,928 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-08 08:44:44,928 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-08 08:44:44,928 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-08 08:44:44,929 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-08 08:44:44,929 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-08 08:44:44,929 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-08 08:44:44,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-08 08:44:44,929 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-08 08:44:44,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-08 08:44:44,929 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-08 08:44:44,929 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-08 08:44:44,929 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-08 08:44:44,929 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-08 08:44:44,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:44,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-08 08:44:44,930 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-08 08:44:44,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:44,930 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-08 08:44:44,930 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-08 08:44:44,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:44,931 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,931 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-08 08:44:44,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-08 08:44:44,931 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-08 08:44:44,931 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-08 08:44:44,932 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-08 08:44:44,932 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:44,932 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:44,932 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-08 08:44:44,932 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-08 08:44:44,932 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-08 08:44:44,932 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-08 08:44:44,933 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-08 08:44:44,933 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-08 08:44:44,933 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-08 08:44:44,933 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-08 08:44:44,933 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-08 08:44:44,934 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-08 08:44:44,934 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-08 08:44:44,934 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-08 08:44:44,934 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-08 08:44:44,934 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-08 08:44:44,934 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-08 08:44:44,934 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-08 08:44:44,934 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:44,935 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 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-08 08:44:44,935 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-08 08:44:44,936 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-08 08:44:44,936 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:44,936 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,936 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-08 08:44:44,937 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-08 08:44:44,937 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-08 08:44:44,937 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-08 08:44:44,937 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-08 08:44:44,937 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-08 08:44:44,937 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-08 08:44:44,937 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-08 08:44:44,938 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-08 08:44:44,938 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-08 08:44:44,938 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-08 08:44:44,938 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-08 08:44:44,939 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-08 08:44:44,939 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-08 08:44:44,939 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-08 08:44:44,939 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-08 08:44:44,939 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-08 08:44:44,940 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-08 08:44:44,940 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-08 08:44:44,940 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,940 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-08 08:44:44,941 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-08 08:44:44,941 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-08 08:44:44,941 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-08 08:44:44,941 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-08 08:44:44,941 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-08 08:44:44,941 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-08 08:44:44,941 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-08 08:44:44,941 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-08 08:44:44,941 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-08 08:44:44,941 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-08 08:44:44,941 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-08 08:44:44,942 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-08 08:44:44,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:44:45,121 INFO L290 TraceCheckUtils]: 177: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-08 08:44:45,121 INFO L290 TraceCheckUtils]: 176: Hoare triple {105062#false} assume 5 == ~blastFlag~0; {105062#false} is VALID [2022-04-08 08:44:45,121 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-08 08:44:45,121 INFO L290 TraceCheckUtils]: 174: Hoare triple {105062#false} assume 4433 == #t~mem63;havoc #t~mem63; {105062#false} is VALID [2022-04-08 08:44:45,121 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-08 08:44:45,121 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-08 08:44:45,121 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-08 08:44:45,121 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 INFO L290 TraceCheckUtils]: 158: Hoare triple {105062#false} assume !false; {105062#false} is VALID [2022-04-08 08:44:45,122 INFO L290 TraceCheckUtils]: 157: Hoare triple {105062#false} ~skip~0 := 0; {105062#false} is VALID [2022-04-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 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-08 08:44:45,122 INFO L290 TraceCheckUtils]: 153: Hoare triple {105062#false} assume !(0 == ~tmp___4~0); {105062#false} is VALID [2022-04-08 08:44:45,123 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-08 08:44:45,123 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-08 08:44:45,123 INFO L290 TraceCheckUtils]: 150: Hoare triple {105062#false} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105062#false} is VALID [2022-04-08 08:44:45,123 INFO L290 TraceCheckUtils]: 149: Hoare triple {105062#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105062#false} is VALID [2022-04-08 08:44:45,123 INFO L290 TraceCheckUtils]: 148: Hoare triple {105062#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105062#false} is VALID [2022-04-08 08:44:45,123 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-08 08:44:45,124 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-08 08:44:45,124 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-08 08:44:45,124 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-08 08:44:45,125 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-08 08:44:45,125 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-08 08:44:45,125 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-08 08:44:45,125 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-08 08:44:45,126 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-08 08:44:45,126 INFO L290 TraceCheckUtils]: 138: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-08 08:44:45,126 INFO L290 TraceCheckUtils]: 137: Hoare triple {105061#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {105061#true} is VALID [2022-04-08 08:44:45,126 INFO L290 TraceCheckUtils]: 136: Hoare triple {105061#true} assume !(2 == ~blastFlag~0); {105061#true} is VALID [2022-04-08 08:44:45,126 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-08 08:44:45,126 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-08 08:44:45,126 INFO L290 TraceCheckUtils]: 133: Hoare triple {105061#true} assume 4401 == #t~mem59;havoc #t~mem59; {105061#true} is VALID [2022-04-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 INFO L290 TraceCheckUtils]: 121: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:45,127 INFO L290 TraceCheckUtils]: 120: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,127 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-08 08:44:45,128 INFO L290 TraceCheckUtils]: 116: Hoare triple {105061#true} assume !(5 == ~blastFlag~0); {105061#true} is VALID [2022-04-08 08:44:45,128 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-08 08:44:45,128 INFO L290 TraceCheckUtils]: 114: Hoare triple {105061#true} assume 4432 == #t~mem62;havoc #t~mem62; {105061#true} is VALID [2022-04-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,128 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-08 08:44:45,129 INFO L290 TraceCheckUtils]: 99: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:45,129 INFO L290 TraceCheckUtils]: 98: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 INFO L290 TraceCheckUtils]: 95: Hoare triple {105061#true} assume !(0 == ~tmp___6~0); {105061#true} is VALID [2022-04-08 08:44:45,129 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-08 08:44:45,129 INFO L290 TraceCheckUtils]: 93: Hoare triple {105061#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {105061#true} is VALID [2022-04-08 08:44:45,129 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-08 08:44:45,129 INFO L290 TraceCheckUtils]: 91: Hoare triple {105061#true} assume 4416 == #t~mem60;havoc #t~mem60; {105061#true} is VALID [2022-04-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,129 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-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 INFO L290 TraceCheckUtils]: 78: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:45,130 INFO L290 TraceCheckUtils]: 77: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 INFO L290 TraceCheckUtils]: 73: Hoare triple {105061#true} assume !(~ret~0 <= 0); {105061#true} is VALID [2022-04-08 08:44:45,130 INFO L290 TraceCheckUtils]: 72: Hoare triple {105061#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {105061#true} is VALID [2022-04-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {105061#true} assume 4400 == #t~mem58;havoc #t~mem58; {105061#true} is VALID [2022-04-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,130 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-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:45,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {105061#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {105061#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {105061#true} is VALID [2022-04-08 08:44:45,131 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-08 08:44:45,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {105061#true} assume 4384 == #t~mem56;havoc #t~mem56; {105061#true} is VALID [2022-04-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,131 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:45,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {105061#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {105061#true} is VALID [2022-04-08 08:44:45,132 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-08 08:44:45,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {105061#true} assume 4368 == #t~mem54;havoc #t~mem54; {105061#true} is VALID [2022-04-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,132 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-08 08:44:45,133 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-08 08:44:45,133 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-08 08:44:45,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:45,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {105061#true} ~skip~0 := 0; {105061#true} is VALID [2022-04-08 08:44:45,133 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-08 08:44:45,133 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-08 08:44:45,133 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-08 08:44:45,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {105061#true} assume !(0 == ~tmp___4~0); {105061#true} is VALID [2022-04-08 08:44:45,133 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-08 08:44:45,133 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-08 08:44:45,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {105061#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:45,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {105061#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {105061#true} is VALID [2022-04-08 08:44:45,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {105061#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {105061#true} is VALID [2022-04-08 08:44:45,133 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-08 08:44:45,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {105061#true} assume 12292 == #t~mem49;havoc #t~mem49; {105061#true} is VALID [2022-04-08 08:44:45,133 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-08 08:44:45,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {105061#true} assume !false; {105061#true} is VALID [2022-04-08 08:44:45,133 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-08 08:44:45,134 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-08 08:44:45,134 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-08 08:44:45,134 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-08 08:44:45,134 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-08 08:44:45,134 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-08 08:44:45,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {105061#true} call #t~ret158 := main(); {105061#true} is VALID [2022-04-08 08:44:45,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105061#true} {105061#true} #593#return; {105061#true} is VALID [2022-04-08 08:44:45,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {105061#true} assume true; {105061#true} is VALID [2022-04-08 08:44:45,134 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-08 08:44:45,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {105061#true} call ULTIMATE.init(); {105061#true} is VALID [2022-04-08 08:44:45,134 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-08 08:44:45,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951642034] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:44:45,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:44:45,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-08 08:44:45,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:45,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487092895] [2022-04-08 08:44:45,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487092895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:45,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:45,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:44:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557348301] [2022-04-08 08:44:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:45,135 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-08 08:44:45,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:45,136 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-08 08:44:45,214 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-08 08:44:45,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:44:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:45,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:44:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:44:45,215 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-08 08:44:49,256 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-08 08:44:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:52,744 INFO L93 Difference]: Finished difference Result 2580 states and 3790 transitions. [2022-04-08 08:44:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:44:52,745 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-08 08:44:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:52,745 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-08 08:44:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-04-08 08:44:52,747 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-08 08:44:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-04-08 08:44:52,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 461 transitions. [2022-04-08 08:44:53,056 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-08 08:44:53,131 INFO L225 Difference]: With dead ends: 2580 [2022-04-08 08:44:53,131 INFO L226 Difference]: Without dead ends: 1450 [2022-04-08 08:44:53,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 357 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-08 08:44:53,134 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-08 08:44:53,134 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-08 08:44:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-04-08 08:44:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1146. [2022-04-08 08:44:53,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:53,529 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-08 08:44:53,530 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-08 08:44:53,530 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-08 08:44:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:53,583 INFO L93 Difference]: Finished difference Result 1450 states and 2107 transitions. [2022-04-08 08:44:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2022-04-08 08:44:53,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:53,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:53,586 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-08 08:44:53,587 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-08 08:44:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:53,639 INFO L93 Difference]: Finished difference Result 1450 states and 2107 transitions. [2022-04-08 08:44:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2022-04-08 08:44:53,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:53,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:53,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:53,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:53,642 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-08 08:44:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1663 transitions. [2022-04-08 08:44:53,690 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1663 transitions. Word has length 178 [2022-04-08 08:44:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:53,690 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1663 transitions. [2022-04-08 08:44:53,690 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-08 08:44:53,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1663 transitions. [2022-04-08 08:44:55,254 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-08 08:44:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1663 transitions. [2022-04-08 08:44:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-08 08:44:55,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:55,256 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-08 08:44:55,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 08:44:55,469 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-08 08:44:55,470 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash -543824043, now seen corresponding path program 1 times [2022-04-08 08:44:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:55,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1018400484] [2022-04-08 08:45:09,667 WARN L232 SmtUtils]: Spent 9.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-08 08:45:19,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:45:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash -543824043, now seen corresponding path program 2 times [2022-04-08 08:45:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:45:19,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690581480] [2022-04-08 08:45:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:45:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:45:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:45:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:45:19,355 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-08 08:45:19,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-08 08:45:19,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-08 08:45:19,356 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-08 08:45:19,356 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-08 08:45:19,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-08 08:45:19,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-08 08:45:19,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-08 08:45:19,356 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-08 08:45:19,356 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-08 08:45:19,356 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-08 08:45:19,356 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-08 08:45:19,356 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-08 08:45:19,356 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-08 08:45:19,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:45:19,356 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-08 08:45:19,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-08 08:45:19,357 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-08 08:45:19,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:45:19,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-08 08:45:19,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:45:19,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 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-08 08:45:19,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-08 08:45:19,358 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-08 08:45:19,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:45:19,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 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-08 08:45:19,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-08 08:45:19,358 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-08 08:45:19,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:45:19,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 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-08 08:45:19,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-08 08:45:19,360 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:45:19,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,360 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-08 08:45:19,364 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-08 08:45:19,364 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-08 08:45:19,364 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-08 08:45:19,364 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-08 08:45:19,365 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-08 08:45:19,365 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:45:19,365 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,365 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-08 08:45:19,366 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-08 08:45:19,366 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:45:19,366 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,366 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-08 08:45:19,367 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-08 08:45:19,367 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-08 08:45:19,367 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-08 08:45:19,367 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-08 08:45:19,367 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-08 08:45:19,367 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-08 08:45:19,367 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-08 08:45:19,367 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-08 08:45:19,367 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-08 08:45:19,367 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-08 08:45:19,367 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-08 08:45:19,367 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-08 08:45:19,378 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-08 08:45:19,379 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-08 08:45:19,379 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-08 08:45:19,379 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-08 08:45:19,379 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-08 08:45:19,380 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-08 08:45:19,380 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-08 08:45:19,380 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-08 08:45:19,380 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-08 08:45:19,381 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-08 08:45:19,381 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-08 08:45:19,381 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-08 08:45:19,381 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-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-08 08:45:19,382 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,382 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-08 08:45:19,383 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-08 08:45:19,383 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-08 08:45:19,383 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-08 08:45:19,383 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-08 08:45:19,383 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-08 08:45:19,383 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-08 08:45:19,383 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-08 08:45:19,383 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-08 08:45:19,383 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-08 08:45:19,383 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-08 08:45:19,383 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-08 08:45:19,383 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-08 08:45:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:45:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690581480] [2022-04-08 08:45:19,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690581480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:45:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681229126] [2022-04-08 08:45:19,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:45:19,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:45:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:45:19,385 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-08 08:45:19,386 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-08 08:46:05,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:46:05,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:46:05,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 08:46:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:05,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:46:05,195 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:46:05,195 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-08 08:46:05,206 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-08 08:46:05,211 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-08 08:46:05,217 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-08 08:46:05,318 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-08 08:46:05,327 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-08 08:46:05,366 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:46:05,366 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-08 08:46:05,472 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-08 08:46:05,590 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:46:05,590 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-08 08:46:05,648 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-08 08:46:05,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116495#true} is VALID [2022-04-08 08:46:05,696 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-08 08:46:05,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-08 08:46:05,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-08 08:46:05,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-08 08:46:05,696 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-08 08:46:05,696 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-08 08:46:05,696 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-08 08:46:05,696 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-08 08:46:05,696 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-08 08:46:05,696 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-08 08:46:05,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,696 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-08 08:46:05,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-08 08:46:05,696 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-08 08:46:05,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:46:05,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-08 08:46:05,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:46:05,697 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-08 08:46:05,697 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-08 08:46:05,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-08 08:46:05,699 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-08 08:46:05,699 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-08 08:46:05,700 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-08 08:46:05,700 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-08 08:46:05,700 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-08 08:46:05,700 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-08 08:46:05,701 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-08 08:46:05,701 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-08 08:46:05,702 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-08 08:46:05,702 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-08 08:46:05,702 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-08 08:46:05,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-08 08:46:05,702 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-08 08:46:05,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-08 08:46:05,702 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-08 08:46:05,702 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-08 08:46:05,702 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-08 08:46:05,702 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-08 08:46:05,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,702 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-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-08 08:46:05,703 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-08 08:46:05,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:46:05,703 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-08 08:46:05,703 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-08 08:46:05,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,703 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-08 08:46:05,704 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-08 08:46:05,704 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-08 08:46:05,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-08 08:46:05,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,705 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-08 08:46:05,706 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-08 08:46:05,706 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-08 08:46:05,706 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-08 08:46:05,707 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-08 08:46:05,707 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-08 08:46:05,707 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-08 08:46:05,707 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-08 08:46:05,707 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-08 08:46:05,707 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-08 08:46:05,707 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-08 08:46:05,707 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-08 08:46:05,707 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-08 08:46:05,708 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,708 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 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-08 08:46:05,708 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-08 08:46:05,708 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-08 08:46:05,709 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,709 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 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-08 08:46:05,709 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-08 08:46:05,709 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-08 08:46:05,710 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-08 08:46:05,710 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-08 08:46:05,710 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-08 08:46:05,710 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-08 08:46:05,710 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-08 08:46:05,711 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-08 08:46:05,711 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-08 08:46:05,711 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-08 08:46:05,712 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-08 08:46:05,712 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-08 08:46:05,712 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-08 08:46:05,713 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-08 08:46:05,713 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-08 08:46:05,713 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-08 08:46:05,714 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-08 08:46:05,714 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-08 08:46:05,714 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-08 08:46:05,715 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-08 08:46:05,715 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-08 08:46:05,715 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-08 08:46:05,715 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-08 08:46:05,715 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-08 08:46:05,715 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-08 08:46:05,715 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-08 08:46:05,715 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-08 08:46:05,715 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-08 08:46:05,715 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-08 08:46:05,715 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-08 08:46:05,715 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-08 08:46:05,715 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 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-08 08:46:05,716 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-08 08:46:05,716 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-08 08:46:05,716 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-08 08:46:05,716 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-08 08:46:05,717 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-08 08:46:05,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:46:05,982 INFO L290 TraceCheckUtils]: 179: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-08 08:46:05,983 INFO L290 TraceCheckUtils]: 178: Hoare triple {116496#false} assume 5 == ~blastFlag~0; {116496#false} is VALID [2022-04-08 08:46:05,983 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-08 08:46:05,983 INFO L290 TraceCheckUtils]: 176: Hoare triple {116496#false} assume 4432 == #t~mem62;havoc #t~mem62; {116496#false} is VALID [2022-04-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,983 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-08 08:46:05,984 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-08 08:46:05,984 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-08 08:46:05,984 INFO L290 TraceCheckUtils]: 161: Hoare triple {116496#false} assume !false; {116496#false} is VALID [2022-04-08 08:46:05,984 INFO L290 TraceCheckUtils]: 160: Hoare triple {116496#false} ~skip~0 := 0; {116496#false} is VALID [2022-04-08 08:46:05,984 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-08 08:46:05,984 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-08 08:46:05,984 INFO L290 TraceCheckUtils]: 157: Hoare triple {116496#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116496#false} is VALID [2022-04-08 08:46:05,984 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-08 08:46:05,984 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-08 08:46:05,984 INFO L290 TraceCheckUtils]: 154: Hoare triple {116496#false} assume !(1 == ~blastFlag~0); {116496#false} is VALID [2022-04-08 08:46:05,984 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-08 08:46:05,984 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-08 08:46:05,985 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-08 08:46:05,985 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-08 08:46:05,985 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-08 08:46:05,985 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-08 08:46:05,986 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-08 08:46:05,986 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-08 08:46:05,986 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-08 08:46:05,986 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-08 08:46:05,987 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-08 08:46:05,987 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-08 08:46:05,987 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-08 08:46:05,987 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-08 08:46:05,988 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-08 08:46:05,988 INFO L290 TraceCheckUtils]: 138: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-08 08:46:05,988 INFO L290 TraceCheckUtils]: 137: Hoare triple {116495#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {116495#true} is VALID [2022-04-08 08:46:05,988 INFO L290 TraceCheckUtils]: 136: Hoare triple {116495#true} assume !(2 == ~blastFlag~0); {116495#true} is VALID [2022-04-08 08:46:05,988 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-08 08:46:05,988 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-08 08:46:05,988 INFO L290 TraceCheckUtils]: 133: Hoare triple {116495#true} assume 4401 == #t~mem59;havoc #t~mem59; {116495#true} is VALID [2022-04-08 08:46:05,988 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-08 08:46:05,988 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 INFO L290 TraceCheckUtils]: 121: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,989 INFO L290 TraceCheckUtils]: 120: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,989 INFO L290 TraceCheckUtils]: 116: Hoare triple {116495#true} assume !(5 == ~blastFlag~0); {116495#true} is VALID [2022-04-08 08:46:05,989 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-08 08:46:05,989 INFO L290 TraceCheckUtils]: 114: Hoare triple {116495#true} assume 4432 == #t~mem62;havoc #t~mem62; {116495#true} is VALID [2022-04-08 08:46:05,989 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-08 08:46:05,989 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 INFO L290 TraceCheckUtils]: 99: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,990 INFO L290 TraceCheckUtils]: 98: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,990 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-08 08:46:05,990 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-08 08:46:05,990 INFO L290 TraceCheckUtils]: 95: Hoare triple {116495#true} assume !(0 == ~tmp___6~0); {116495#true} is VALID [2022-04-08 08:46:05,990 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-08 08:46:05,991 INFO L290 TraceCheckUtils]: 93: Hoare triple {116495#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {116495#true} is VALID [2022-04-08 08:46:05,991 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-08 08:46:05,991 INFO L290 TraceCheckUtils]: 91: Hoare triple {116495#true} assume 4416 == #t~mem60;havoc #t~mem60; {116495#true} is VALID [2022-04-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 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-08 08:46:05,991 INFO L290 TraceCheckUtils]: 78: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,991 INFO L290 TraceCheckUtils]: 77: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,991 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 INFO L290 TraceCheckUtils]: 73: Hoare triple {116495#true} assume !(~ret~0 <= 0); {116495#true} is VALID [2022-04-08 08:46:05,992 INFO L290 TraceCheckUtils]: 72: Hoare triple {116495#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {116495#true} is VALID [2022-04-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 INFO L290 TraceCheckUtils]: 69: Hoare triple {116495#true} assume 4400 == #t~mem58;havoc #t~mem58; {116495#true} is VALID [2022-04-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 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-08 08:46:05,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {116495#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {116495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116495#true} is VALID [2022-04-08 08:46:05,993 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-08 08:46:05,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {116495#true} assume 4384 == #t~mem56;havoc #t~mem56; {116495#true} is VALID [2022-04-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 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-08 08:46:05,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {116495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116495#true} is VALID [2022-04-08 08:46:05,994 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-08 08:46:05,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {116495#true} assume 4368 == #t~mem54;havoc #t~mem54; {116495#true} is VALID [2022-04-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {116495#true} ~skip~0 := 0; {116495#true} is VALID [2022-04-08 08:46:05,994 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-08 08:46:05,994 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-08 08:46:05,995 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-08 08:46:05,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {116495#true} assume !(0 == ~tmp___4~0); {116495#true} is VALID [2022-04-08 08:46:05,995 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-08 08:46:05,995 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-08 08:46:05,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {116495#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:46:05,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {116495#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {116495#true} is VALID [2022-04-08 08:46:05,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {116495#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {116495#true} is VALID [2022-04-08 08:46:05,995 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-08 08:46:05,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {116495#true} assume 12292 == #t~mem49;havoc #t~mem49; {116495#true} is VALID [2022-04-08 08:46:05,995 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-08 08:46:05,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {116495#true} assume !false; {116495#true} is VALID [2022-04-08 08:46:05,995 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-08 08:46:05,995 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-08 08:46:05,995 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-08 08:46:05,995 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-08 08:46:05,995 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-08 08:46:05,995 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-08 08:46:05,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {116495#true} call #t~ret158 := main(); {116495#true} is VALID [2022-04-08 08:46:05,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116495#true} {116495#true} #593#return; {116495#true} is VALID [2022-04-08 08:46:05,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {116495#true} assume true; {116495#true} is VALID [2022-04-08 08:46:05,996 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-08 08:46:05,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {116495#true} call ULTIMATE.init(); {116495#true} is VALID [2022-04-08 08:46:05,996 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-08 08:46:05,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681229126] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:46:05,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:46:05,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-08 08:46:05,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:46:05,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1018400484] [2022-04-08 08:46:05,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1018400484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:46:05,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:46:05,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:46:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493191346] [2022-04-08 08:46:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:46:05,998 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-08 08:46:05,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:46:05,999 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-08 08:46:06,045 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-08 08:46:06,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:46:06,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:06,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:46:06,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:46:06,046 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-08 08:46:10,082 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-08 08:46:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:13,548 INFO L93 Difference]: Finished difference Result 2625 states and 3805 transitions. [2022-04-08 08:46:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:46:13,548 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-08 08:46:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:46:13,548 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-08 08:46:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:46:13,550 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-08 08:46:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:46:13,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-08 08:46:13,868 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-08 08:46:13,946 INFO L225 Difference]: With dead ends: 2625 [2022-04-08 08:46:13,946 INFO L226 Difference]: Without dead ends: 1495 [2022-04-08 08:46:13,947 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-08 08:46:13,948 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-08 08:46:13,948 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-08 08:46:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-04-08 08:46:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1146. [2022-04-08 08:46:14,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:46:14,316 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-08 08:46:14,317 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-08 08:46:14,318 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-08 08:46:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:14,372 INFO L93 Difference]: Finished difference Result 1495 states and 2142 transitions. [2022-04-08 08:46:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2142 transitions. [2022-04-08 08:46:14,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:14,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:14,374 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-08 08:46:14,375 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-08 08:46:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:46:14,431 INFO L93 Difference]: Finished difference Result 1495 states and 2142 transitions. [2022-04-08 08:46:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2142 transitions. [2022-04-08 08:46:14,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:46:14,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:46:14,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:46:14,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:46:14,433 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-08 08:46:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1643 transitions. [2022-04-08 08:46:14,482 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1643 transitions. Word has length 180 [2022-04-08 08:46:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:46:14,482 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1643 transitions. [2022-04-08 08:46:14,482 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-08 08:46:14,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1643 transitions. [2022-04-08 08:46:16,125 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-08 08:46:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1643 transitions. [2022-04-08 08:46:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-08 08:46:16,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:46:16,127 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-08 08:46:16,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 08:46:16,327 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-08 08:46:16,328 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:46:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:46:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash -684613610, now seen corresponding path program 1 times [2022-04-08 08:46:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:46:16,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610080515] [2022-04-08 08:46:31,228 WARN L232 SmtUtils]: Spent 10.28s 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-08 08:46:39,201 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:46:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash -684613610, now seen corresponding path program 2 times [2022-04-08 08:46:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:46:39,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75267386] [2022-04-08 08:46:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:46:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:46:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:46:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:46:39,406 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-08 08:46:39,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-08 08:46:39,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-08 08:46:39,406 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-08 08:46:39,407 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-08 08:46:39,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-08 08:46:39,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-08 08:46:39,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-08 08:46:39,407 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-08 08:46:39,407 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-08 08:46:39,407 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-08 08:46:39,407 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-08 08:46:39,407 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-08 08:46:39,407 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-08 08:46:39,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:46:39,407 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-08 08:46:39,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-08 08:46:39,407 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-08 08:46:39,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:46:39,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-08 08:46:39,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:46:39,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-08 08:46:39,408 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-08 08:46:39,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-08 08:46:39,408 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-08 08:46:39,408 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-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:46:39,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-08 08:46:39,409 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-08 08:46:39,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-08 08:46:39,409 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-08 08:46:39,409 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-08 08:46:39,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:46:39,409 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-08 08:46:39,410 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-08 08:46:39,410 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:46:39,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-08 08:46:39,410 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-08 08:46:39,410 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-08 08:46:39,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-08 08:46:39,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:46:39,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,411 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-08 08:46:39,412 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-08 08:46:39,412 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-08 08:46:39,412 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-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,413 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-08 08:46:39,413 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-08 08:46:39,413 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,413 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:46:39,413 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,413 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-08 08:46:39,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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-08 08:46:39,414 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-08 08:46:39,414 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:46:39,414 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,414 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-08 08:46:39,415 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-08 08:46:39,415 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-08 08:46:39,415 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-08 08:46:39,415 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-08 08:46:39,415 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-08 08:46:39,415 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-08 08:46:39,415 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-08 08:46:39,415 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-08 08:46:39,415 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-08 08:46:39,415 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-08 08:46:39,415 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-08 08:46:39,415 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-08 08:46:39,415 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-08 08:46:39,416 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-08 08:46:39,416 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-08 08:46:39,417 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-08 08:46:39,417 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-08 08:46:39,417 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-08 08:46:39,417 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-08 08:46:39,418 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-08 08:46:39,418 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-08 08:46:39,418 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-08 08:46:39,418 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-08 08:46:39,418 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-08 08:46:39,419 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-08 08:46:39,419 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-08 08:46:39,419 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-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-08 08:46:39,420 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,420 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-08 08:46:39,421 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-08 08:46:39,421 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-08 08:46:39,421 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-08 08:46:39,421 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-08 08:46:39,421 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-08 08:46:39,421 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-08 08:46:39,421 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-08 08:46:39,421 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-08 08:46:39,421 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-08 08:46:39,421 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-08 08:46:39,421 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-08 08:46:39,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:46:39,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75267386] [2022-04-08 08:46:39,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75267386] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:46:39,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017671880] [2022-04-08 08:46:39,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:46:39,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:46:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:46:39,432 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-08 08:46:39,467 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-08 08:47:39,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:47:39,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:47:39,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 08:47:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:47:39,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:47:39,520 INFO L356 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-04-08 08:47:39,521 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-08 08:47:39,524 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-08 08:47:39,528 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-08 08:47:39,533 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-08 08:47:39,660 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-04-08 08:47:39,667 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-08 08:47:39,669 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-08 08:47:39,712 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-08 08:47:39,712 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-08 08:47:39,809 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-08 08:47:39,903 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:47:39,903 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-08 08:47:39,967 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-08 08:47:40,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128121#true} is VALID [2022-04-08 08:47:40,018 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-08 08:47:40,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-08 08:47:40,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-08 08:47:40,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-08 08:47:40,019 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-08 08:47:40,019 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-08 08:47:40,019 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-08 08:47:40,019 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-08 08:47:40,019 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-08 08:47:40,019 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-08 08:47:40,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,019 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-08 08:47:40,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-08 08:47:40,019 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-08 08:47:40,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:47:40,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-08 08:47:40,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:47:40,019 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-08 08:47:40,019 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-08 08:47:40,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-08 08:47:40,020 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-08 08:47:40,021 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-08 08:47:40,021 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-08 08:47:40,022 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-08 08:47:40,022 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-08 08:47:40,022 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-08 08:47:40,023 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-08 08:47:40,023 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-08 08:47:40,023 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-08 08:47:40,024 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-08 08:47:40,024 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-08 08:47:40,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-08 08:47:40,024 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-08 08:47:40,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-08 08:47:40,024 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-08 08:47:40,024 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-08 08:47:40,024 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-08 08:47:40,024 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-08 08:47:40,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,024 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-08 08:47:40,024 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-08 08:47:40,024 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-08 08:47:40,024 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-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-08 08:47:40,025 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-08 08:47:40,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,025 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-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-08 08:47:40,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,026 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-08 08:47:40,027 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-08 08:47:40,027 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-08 08:47:40,027 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-08 08:47:40,027 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-08 08:47:40,027 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-08 08:47:40,027 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-08 08:47:40,027 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-08 08:47:40,028 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-08 08:47:40,028 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-08 08:47:40,028 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-08 08:47:40,028 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-08 08:47:40,028 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-08 08:47:40,028 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-08 08:47:40,028 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-08 08:47:40,028 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-08 08:47:40,028 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-08 08:47:40,029 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,029 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 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-08 08:47:40,029 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-08 08:47:40,029 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-08 08:47:40,029 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,030 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 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-08 08:47:40,030 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-08 08:47:40,030 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-08 08:47:40,031 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-08 08:47:40,031 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-08 08:47:40,031 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-08 08:47:40,031 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-08 08:47:40,035 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-08 08:47:40,036 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-08 08:47:40,036 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-08 08:47:40,037 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-08 08:47:40,037 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-08 08:47:40,037 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-08 08:47:40,038 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-08 08:47:40,038 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-08 08:47:40,038 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-08 08:47:40,039 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-08 08:47:40,039 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-08 08:47:40,039 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-08 08:47:40,040 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-08 08:47:40,040 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-08 08:47:40,040 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-08 08:47:40,040 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-08 08:47:40,041 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-08 08:47:40,041 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,041 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-08 08:47:40,047 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-08 08:47:40,047 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-08 08:47:40,047 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-08 08:47:40,047 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-08 08:47:40,048 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-08 08:47:40,048 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-08 08:47:40,048 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-08 08:47:40,048 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-08 08:47:40,048 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-08 08:47:40,048 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-08 08:47:40,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:47:40,264 INFO L290 TraceCheckUtils]: 180: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-08 08:47:40,267 INFO L290 TraceCheckUtils]: 179: Hoare triple {128122#false} assume 5 == ~blastFlag~0; {128122#false} is VALID [2022-04-08 08:47:40,268 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-08 08:47:40,268 INFO L290 TraceCheckUtils]: 177: Hoare triple {128122#false} assume 4432 == #t~mem62;havoc #t~mem62; {128122#false} is VALID [2022-04-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 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-08 08:47:40,268 INFO L290 TraceCheckUtils]: 162: Hoare triple {128122#false} assume !false; {128122#false} is VALID [2022-04-08 08:47:40,268 INFO L290 TraceCheckUtils]: 161: Hoare triple {128122#false} ~skip~0 := 0; {128122#false} is VALID [2022-04-08 08:47:40,269 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-08 08:47:40,269 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-08 08:47:40,269 INFO L290 TraceCheckUtils]: 158: Hoare triple {128122#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128122#false} is VALID [2022-04-08 08:47:40,269 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-08 08:47:40,269 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-08 08:47:40,269 INFO L290 TraceCheckUtils]: 155: Hoare triple {128122#false} assume !(1 == ~blastFlag~0); {128122#false} is VALID [2022-04-08 08:47:40,269 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-08 08:47:40,286 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-08 08:47:40,287 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-08 08:47:40,287 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-08 08:47:40,287 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-08 08:47:40,287 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-08 08:47:40,287 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-08 08:47:40,288 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-08 08:47:40,288 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-08 08:47:40,288 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-08 08:47:40,288 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-08 08:47:40,288 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-08 08:47:40,289 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-08 08:47:40,289 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-08 08:47:40,289 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-08 08:47:40,290 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-08 08:47:40,290 INFO L290 TraceCheckUtils]: 138: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-08 08:47:40,290 INFO L290 TraceCheckUtils]: 137: Hoare triple {128121#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {128121#true} is VALID [2022-04-08 08:47:40,290 INFO L290 TraceCheckUtils]: 136: Hoare triple {128121#true} assume !(2 == ~blastFlag~0); {128121#true} is VALID [2022-04-08 08:47:40,290 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-08 08:47:40,290 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-08 08:47:40,290 INFO L290 TraceCheckUtils]: 133: Hoare triple {128121#true} assume 4401 == #t~mem59;havoc #t~mem59; {128121#true} is VALID [2022-04-08 08:47:40,290 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-08 08:47:40,290 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-08 08:47:40,290 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-08 08:47:40,290 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-08 08:47:40,290 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 INFO L290 TraceCheckUtils]: 121: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,291 INFO L290 TraceCheckUtils]: 120: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 INFO L290 TraceCheckUtils]: 116: Hoare triple {128121#true} assume !(5 == ~blastFlag~0); {128121#true} is VALID [2022-04-08 08:47:40,291 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-08 08:47:40,291 INFO L290 TraceCheckUtils]: 114: Hoare triple {128121#true} assume 4432 == #t~mem62;havoc #t~mem62; {128121#true} is VALID [2022-04-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,291 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 INFO L290 TraceCheckUtils]: 99: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,292 INFO L290 TraceCheckUtils]: 98: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,292 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-08 08:47:40,292 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-08 08:47:40,292 INFO L290 TraceCheckUtils]: 95: Hoare triple {128121#true} assume !(0 == ~tmp___6~0); {128121#true} is VALID [2022-04-08 08:47:40,292 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-08 08:47:40,292 INFO L290 TraceCheckUtils]: 93: Hoare triple {128121#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {128121#true} is VALID [2022-04-08 08:47:40,292 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-08 08:47:40,292 INFO L290 TraceCheckUtils]: 91: Hoare triple {128121#true} assume 4416 == #t~mem60;havoc #t~mem60; {128121#true} is VALID [2022-04-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 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-08 08:47:40,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {128121#true} assume !(~ret~0 <= 0); {128121#true} is VALID [2022-04-08 08:47:40,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {128121#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {128121#true} is VALID [2022-04-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 INFO L290 TraceCheckUtils]: 69: Hoare triple {128121#true} assume 4400 == #t~mem58;havoc #t~mem58; {128121#true} is VALID [2022-04-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,294 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-08 08:47:40,294 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-08 08:47:40,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {128121#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {128121#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128121#true} is VALID [2022-04-08 08:47:40,295 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-08 08:47:40,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {128121#true} assume 4384 == #t~mem56;havoc #t~mem56; {128121#true} is VALID [2022-04-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,295 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-08 08:47:40,296 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-08 08:47:40,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {128121#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128121#true} is VALID [2022-04-08 08:47:40,296 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-08 08:47:40,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {128121#true} assume 4368 == #t~mem54;havoc #t~mem54; {128121#true} is VALID [2022-04-08 08:47:40,296 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-08 08:47:40,296 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-08 08:47:40,296 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-08 08:47:40,296 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-08 08:47:40,296 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-08 08:47:40,296 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-08 08:47:40,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {128121#true} ~skip~0 := 0; {128121#true} is VALID [2022-04-08 08:47:40,296 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-08 08:47:40,296 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-08 08:47:40,296 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-08 08:47:40,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {128121#true} assume !(0 == ~tmp___4~0); {128121#true} is VALID [2022-04-08 08:47:40,296 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-08 08:47:40,297 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-08 08:47:40,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {128121#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:47:40,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {128121#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {128121#true} is VALID [2022-04-08 08:47:40,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {128121#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {128121#true} is VALID [2022-04-08 08:47:40,297 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-08 08:47:40,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {128121#true} assume 12292 == #t~mem49;havoc #t~mem49; {128121#true} is VALID [2022-04-08 08:47:40,297 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-08 08:47:40,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {128121#true} assume !false; {128121#true} is VALID [2022-04-08 08:47:40,297 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-08 08:47:40,297 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-08 08:47:40,297 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-08 08:47:40,297 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-08 08:47:40,297 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-08 08:47:40,297 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-08 08:47:40,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {128121#true} call #t~ret158 := main(); {128121#true} is VALID [2022-04-08 08:47:40,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128121#true} {128121#true} #593#return; {128121#true} is VALID [2022-04-08 08:47:40,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {128121#true} assume true; {128121#true} is VALID [2022-04-08 08:47:40,298 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-08 08:47:40,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {128121#true} call ULTIMATE.init(); {128121#true} is VALID [2022-04-08 08:47:40,298 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-08 08:47:40,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017671880] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:47:40,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:47:40,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-04-08 08:47:40,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:47:40,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610080515] [2022-04-08 08:47:40,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610080515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:47:40,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:47:40,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:47:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250385744] [2022-04-08 08:47:40,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:47:40,300 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-08 08:47:40,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:47:40,300 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-08 08:47:40,353 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-08 08:47:40,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:47:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:40,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:47:40,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:47:40,354 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-08 08:47:46,415 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-08 08:47:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:47,803 INFO L93 Difference]: Finished difference Result 2621 states and 3760 transitions. [2022-04-08 08:47:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:47:47,803 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-08 08:47:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:47:47,803 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-08 08:47:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:47:47,806 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-08 08:47:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2022-04-08 08:47:47,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 471 transitions. [2022-04-08 08:47:48,116 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-08 08:47:48,205 INFO L225 Difference]: With dead ends: 2621 [2022-04-08 08:47:48,205 INFO L226 Difference]: Without dead ends: 1491 [2022-04-08 08:47:48,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 363 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-08 08:47:48,207 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-08 08:47:48,207 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-08 08:47:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2022-04-08 08:47:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1146. [2022-04-08 08:47:48,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:47:48,463 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-08 08:47:48,463 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-08 08:47:48,464 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-08 08:47:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:48,518 INFO L93 Difference]: Finished difference Result 1491 states and 2117 transitions. [2022-04-08 08:47:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2117 transitions. [2022-04-08 08:47:48,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:48,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:48,521 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-08 08:47:48,522 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-08 08:47:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:47:48,577 INFO L93 Difference]: Finished difference Result 1491 states and 2117 transitions. [2022-04-08 08:47:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2117 transitions. [2022-04-08 08:47:48,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:47:48,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:47:48,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:47:48,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:47:48,580 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-08 08:47:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1623 transitions. [2022-04-08 08:47:48,654 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1623 transitions. Word has length 181 [2022-04-08 08:47:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:47:48,654 INFO L478 AbstractCegarLoop]: Abstraction has 1146 states and 1623 transitions. [2022-04-08 08:47:48,654 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-08 08:47:48,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1146 states and 1623 transitions. [2022-04-08 08:47:49,930 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-08 08:47:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1623 transitions. [2022-04-08 08:47:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-08 08:47:49,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:47:49,948 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-08 08:47:49,989 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-08 08:47:50,158 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-08 08:47:50,158 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:47:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:47:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1572475012, now seen corresponding path program 1 times [2022-04-08 08:47:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:47:50,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631507475] [2022-04-08 08:48:01,288 WARN L232 SmtUtils]: Spent 7.20s 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-08 08:48:10,959 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:10,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1572475012, now seen corresponding path program 2 times [2022-04-08 08:48:10,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:10,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134692323] [2022-04-08 08:48:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:10,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:11,151 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-08 08:48:11,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {139737#true} assume true; {139737#true} is VALID [2022-04-08 08:48:11,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139737#true} {139737#true} #593#return; {139737#true} is VALID [2022-04-08 08:48:11,152 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-08 08:48:11,152 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-08 08:48:11,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {139737#true} assume true; {139737#true} is VALID [2022-04-08 08:48:11,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139737#true} {139737#true} #593#return; {139737#true} is VALID [2022-04-08 08:48:11,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {139737#true} call #t~ret158 := main(); {139737#true} is VALID [2022-04-08 08:48:11,152 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-08 08:48:11,152 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-08 08:48:11,152 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-08 08:48:11,152 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-08 08:48:11,152 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-08 08:48:11,152 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-08 08:48:11,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-08 08:48:11,153 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-08 08:48:11,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {139737#true} assume 12292 == #t~mem49;havoc #t~mem49; {139737#true} is VALID [2022-04-08 08:48:11,153 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-08 08:48:11,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {139737#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {139737#true} is VALID [2022-04-08 08:48:11,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {139737#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {139737#true} is VALID [2022-04-08 08:48:11,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {139737#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {139737#true} is VALID [2022-04-08 08:48:11,153 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-08 08:48:11,153 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-08 08:48:11,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {139737#true} assume !(0 == ~tmp___4~0); {139737#true} is VALID [2022-04-08 08:48:11,153 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-08 08:48:11,153 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-08 08:48:11,153 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-08 08:48:11,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-08 08:48:11,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-08 08:48:11,153 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-08 08:48:11,153 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-08 08:48:11,153 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-08 08:48:11,153 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {139737#true} assume 4368 == #t~mem54;havoc #t~mem54; {139737#true} is VALID [2022-04-08 08:48:11,154 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-08 08:48:11,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {139737#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {139737#true} is VALID [2022-04-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-08 08:48:11,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,154 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-08 08:48:11,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {139737#true} assume 4384 == #t~mem56;havoc #t~mem56; {139737#true} is VALID [2022-04-08 08:48:11,155 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-08 08:48:11,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {139737#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {139737#true} is VALID [2022-04-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {139737#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {139737#true} is VALID [2022-04-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-08 08:48:11,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,155 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-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {139737#true} assume 4400 == #t~mem58;havoc #t~mem58; {139737#true} is VALID [2022-04-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 INFO L290 TraceCheckUtils]: 72: Hoare triple {139737#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {139737#true} is VALID [2022-04-08 08:48:11,156 INFO L290 TraceCheckUtils]: 73: Hoare triple {139737#true} assume !(~ret~0 <= 0); {139737#true} is VALID [2022-04-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-08 08:48:11,156 INFO L290 TraceCheckUtils]: 78: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,156 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-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 INFO L290 TraceCheckUtils]: 91: Hoare triple {139737#true} assume 4416 == #t~mem60;havoc #t~mem60; {139737#true} is VALID [2022-04-08 08:48:11,157 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-08 08:48:11,157 INFO L290 TraceCheckUtils]: 93: Hoare triple {139737#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {139737#true} is VALID [2022-04-08 08:48:11,157 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-08 08:48:11,157 INFO L290 TraceCheckUtils]: 95: Hoare triple {139737#true} assume !(0 == ~tmp___6~0); {139737#true} is VALID [2022-04-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 INFO L290 TraceCheckUtils]: 98: Hoare triple {139737#true} ~skip~0 := 0; {139737#true} is VALID [2022-04-08 08:48:11,157 INFO L290 TraceCheckUtils]: 99: Hoare triple {139737#true} assume !false; {139737#true} is VALID [2022-04-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,157 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 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-08 08:48:11,158 INFO L290 TraceCheckUtils]: 114: Hoare triple {139737#true} assume 4432 == #t~mem62;havoc #t~mem62; {139737#true} is VALID [2022-04-08 08:48:11,158 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-08 08:48:11,158 INFO L290 TraceCheckUtils]: 116: Hoare triple {139737#true} assume !(5 == ~blastFlag~0); {139737#true} is VALID [2022-04-08 08:48:11,159 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-08 08:48:11,159 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-08 08:48:11,160 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-08 08:48:11,160 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-08 08:48:11,160 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-08 08:48:11,160 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-08 08:48:11,161 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-08 08:48:11,161 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-08 08:48:11,161 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-08 08:48:11,162 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-08 08:48:11,162 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-08 08:48:11,162 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-08 08:48:11,162 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-08 08:48:11,163 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-08 08:48:11,163 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-08 08:48:11,163 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 INFO L290 TraceCheckUtils]: 136: Hoare triple {139738#false} assume !(2 == ~blastFlag~0); {139738#false} is VALID [2022-04-08 08:48:11,164 INFO L290 TraceCheckUtils]: 137: Hoare triple {139738#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {139738#false} is VALID [2022-04-08 08:48:11,164 INFO L290 TraceCheckUtils]: 138: Hoare triple {139738#false} assume !(~ret~0 <= 0); {139738#false} is VALID [2022-04-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 INFO L290 TraceCheckUtils]: 142: Hoare triple {139738#false} ~skip~0 := 0; {139738#false} is VALID [2022-04-08 08:48:11,164 INFO L290 TraceCheckUtils]: 143: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,164 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-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,165 INFO L290 TraceCheckUtils]: 156: Hoare triple {139738#false} assume 4416 == #t~mem60;havoc #t~mem60; {139738#false} is VALID [2022-04-08 08:48:11,165 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-08 08:48:11,165 INFO L290 TraceCheckUtils]: 158: Hoare triple {139738#false} assume !(3 == ~blastFlag~0); {139738#false} is VALID [2022-04-08 08:48:11,165 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-08 08:48:11,165 INFO L290 TraceCheckUtils]: 160: Hoare triple {139738#false} assume !(0 == ~tmp___6~0); {139738#false} is VALID [2022-04-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,165 INFO L290 TraceCheckUtils]: 163: Hoare triple {139738#false} ~skip~0 := 0; {139738#false} is VALID [2022-04-08 08:48:11,165 INFO L290 TraceCheckUtils]: 164: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,165 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 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-08 08:48:11,166 INFO L290 TraceCheckUtils]: 179: Hoare triple {139738#false} assume 4432 == #t~mem62;havoc #t~mem62; {139738#false} is VALID [2022-04-08 08:48:11,166 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-08 08:48:11,166 INFO L290 TraceCheckUtils]: 181: Hoare triple {139738#false} assume 5 == ~blastFlag~0; {139738#false} is VALID [2022-04-08 08:48:11,166 INFO L290 TraceCheckUtils]: 182: Hoare triple {139738#false} assume !false; {139738#false} is VALID [2022-04-08 08:48:11,167 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-08 08:48:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:11,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134692323] [2022-04-08 08:48:11,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134692323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:11,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:11,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:11,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:11,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631507475] [2022-04-08 08:48:11,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631507475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:11,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:11,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8687288] [2022-04-08 08:48:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:11,168 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-08 08:48:11,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:11,168 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-08 08:48:11,273 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-08 08:48:11,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:11,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:11,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:11,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:11,274 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-08 08:48:13,310 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-08 08:48:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:15,020 INFO L93 Difference]: Finished difference Result 2632 states and 3744 transitions. [2022-04-08 08:48:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:15,020 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-08 08:48:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:15,020 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-08 08:48:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:48:15,022 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-08 08:48:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:48:15,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 08:48:15,265 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-08 08:48:15,341 INFO L225 Difference]: With dead ends: 2632 [2022-04-08 08:48:15,341 INFO L226 Difference]: Without dead ends: 1502 [2022-04-08 08:48:15,342 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-08 08:48:15,342 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-08 08:48:15,343 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-08 08:48:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-04-08 08:48:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1167. [2022-04-08 08:48:15,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:15,691 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-08 08:48:15,692 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-08 08:48:15,693 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-08 08:48:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:15,749 INFO L93 Difference]: Finished difference Result 1502 states and 2136 transitions. [2022-04-08 08:48:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2136 transitions. [2022-04-08 08:48:15,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:15,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:15,752 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-08 08:48:15,752 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-08 08:48:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:15,808 INFO L93 Difference]: Finished difference Result 1502 states and 2136 transitions. [2022-04-08 08:48:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2136 transitions. [2022-04-08 08:48:15,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:15,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:15,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:15,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:15,811 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-08 08:48:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1651 transitions. [2022-04-08 08:48:15,860 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1651 transitions. Word has length 183 [2022-04-08 08:48:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:15,861 INFO L478 AbstractCegarLoop]: Abstraction has 1167 states and 1651 transitions. [2022-04-08 08:48:15,861 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-08 08:48:15,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1167 states and 1651 transitions. [2022-04-08 08:48:17,414 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-08 08:48:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1651 transitions. [2022-04-08 08:48:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-04-08 08:48:17,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:17,416 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-08 08:48:17,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:48:17,416 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1259168305, now seen corresponding path program 1 times [2022-04-08 08:48:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:17,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [989569290] [2022-04-08 08:48:31,198 WARN L232 SmtUtils]: Spent 9.66s 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-08 08:48:39,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:48:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1259168305, now seen corresponding path program 2 times [2022-04-08 08:48:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:48:39,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441628496] [2022-04-08 08:48:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:48:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:48:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:48:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:48:40,011 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-08 08:48:40,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {150351#true} assume true; {150351#true} is VALID [2022-04-08 08:48:40,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {150351#true} {150351#true} #593#return; {150351#true} is VALID [2022-04-08 08:48:40,012 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-08 08:48:40,012 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-08 08:48:40,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {150351#true} assume true; {150351#true} is VALID [2022-04-08 08:48:40,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150351#true} {150351#true} #593#return; {150351#true} is VALID [2022-04-08 08:48:40,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {150351#true} call #t~ret158 := main(); {150351#true} is VALID [2022-04-08 08:48:40,012 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-08 08:48:40,012 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-08 08:48:40,012 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-08 08:48:40,012 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-08 08:48:40,013 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-08 08:48:40,013 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-08 08:48:40,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-08 08:48:40,013 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-08 08:48:40,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {150351#true} assume 12292 == #t~mem49;havoc #t~mem49; {150351#true} is VALID [2022-04-08 08:48:40,013 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-08 08:48:40,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {150351#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {150351#true} is VALID [2022-04-08 08:48:40,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {150351#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {150351#true} is VALID [2022-04-08 08:48:40,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {150351#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {150351#true} is VALID [2022-04-08 08:48:40,013 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-08 08:48:40,013 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-08 08:48:40,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {150351#true} assume !(0 == ~tmp___4~0); {150351#true} is VALID [2022-04-08 08:48:40,013 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-08 08:48:40,013 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-08 08:48:40,013 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-08 08:48:40,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-08 08:48:40,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-08 08:48:40,013 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-08 08:48:40,013 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {150351#true} assume 4368 == #t~mem54;havoc #t~mem54; {150351#true} is VALID [2022-04-08 08:48:40,014 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-08 08:48:40,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {150351#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {150351#true} is VALID [2022-04-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-08 08:48:40,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,014 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-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {150351#true} assume 4384 == #t~mem56;havoc #t~mem56; {150351#true} is VALID [2022-04-08 08:48:40,015 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-08 08:48:40,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {150351#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {150351#true} is VALID [2022-04-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {150351#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {150351#true} is VALID [2022-04-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-08 08:48:40,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,015 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-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {150351#true} assume 4400 == #t~mem58;havoc #t~mem58; {150351#true} is VALID [2022-04-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 INFO L290 TraceCheckUtils]: 72: Hoare triple {150351#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {150351#true} is VALID [2022-04-08 08:48:40,016 INFO L290 TraceCheckUtils]: 73: Hoare triple {150351#true} assume !(~ret~0 <= 0); {150351#true} is VALID [2022-04-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 INFO L290 TraceCheckUtils]: 77: Hoare triple {150351#true} ~skip~0 := 0; {150351#true} is VALID [2022-04-08 08:48:40,016 INFO L290 TraceCheckUtils]: 78: Hoare triple {150351#true} assume !false; {150351#true} is VALID [2022-04-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,016 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-08 08:48:40,017 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-08 08:48:40,017 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-08 08:48:40,017 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-08 08:48:40,017 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-08 08:48:40,017 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-08 08:48:40,017 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-08 08:48:40,017 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-08 08:48:40,017 INFO L290 TraceCheckUtils]: 91: Hoare triple {150351#true} assume 4416 == #t~mem60;havoc #t~mem60; {150351#true} is VALID [2022-04-08 08:48:40,017 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-08 08:48:40,017 INFO L290 TraceCheckUtils]: 93: Hoare triple {150351#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {150351#true} is VALID [2022-04-08 08:48:40,018 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-08 08:48:40,018 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-08 08:48:40,018 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-08 08:48:40,019 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-08 08:48:40,019 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-08 08:48:40,019 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-08 08:48:40,019 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-08 08:48:40,019 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-08 08:48:40,020 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-08 08:48:40,020 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-08 08:48:40,020 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-08 08:48:40,020 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-08 08:48:40,020 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-08 08:48:40,021 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-08 08:48:40,021 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-08 08:48:40,021 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-08 08:48:40,021 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-08 08:48:40,022 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-08 08:48:40,022 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-08 08:48:40,022 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-08 08:48:40,022 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-08 08:48:40,022 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-08 08:48:40,022 INFO L290 TraceCheckUtils]: 116: Hoare triple {150352#false} assume 4448 == #t~mem64;havoc #t~mem64; {150352#false} is VALID [2022-04-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 INFO L290 TraceCheckUtils]: 120: Hoare triple {150352#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {150352#false} is VALID [2022-04-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 INFO L290 TraceCheckUtils]: 123: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-08 08:48:40,023 INFO L290 TraceCheckUtils]: 124: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,023 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-08 08:48:40,024 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-08 08:48:40,024 INFO L290 TraceCheckUtils]: 136: Hoare triple {150352#false} assume 4401 == #t~mem59;havoc #t~mem59; {150352#false} is VALID [2022-04-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 INFO L290 TraceCheckUtils]: 139: Hoare triple {150352#false} assume !(2 == ~blastFlag~0); {150352#false} is VALID [2022-04-08 08:48:40,024 INFO L290 TraceCheckUtils]: 140: Hoare triple {150352#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {150352#false} is VALID [2022-04-08 08:48:40,024 INFO L290 TraceCheckUtils]: 141: Hoare triple {150352#false} assume !(~ret~0 <= 0); {150352#false} is VALID [2022-04-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 INFO L290 TraceCheckUtils]: 145: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-08 08:48:40,024 INFO L290 TraceCheckUtils]: 146: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,024 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-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 INFO L290 TraceCheckUtils]: 159: Hoare triple {150352#false} assume 4416 == #t~mem60;havoc #t~mem60; {150352#false} is VALID [2022-04-08 08:48:40,025 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-08 08:48:40,025 INFO L290 TraceCheckUtils]: 161: Hoare triple {150352#false} assume !(3 == ~blastFlag~0); {150352#false} is VALID [2022-04-08 08:48:40,025 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-08 08:48:40,025 INFO L290 TraceCheckUtils]: 163: Hoare triple {150352#false} assume !(0 == ~tmp___6~0); {150352#false} is VALID [2022-04-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 INFO L290 TraceCheckUtils]: 166: Hoare triple {150352#false} ~skip~0 := 0; {150352#false} is VALID [2022-04-08 08:48:40,025 INFO L290 TraceCheckUtils]: 167: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,025 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 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-08 08:48:40,026 INFO L290 TraceCheckUtils]: 182: Hoare triple {150352#false} assume 4432 == #t~mem62;havoc #t~mem62; {150352#false} is VALID [2022-04-08 08:48:40,026 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-08 08:48:40,026 INFO L290 TraceCheckUtils]: 184: Hoare triple {150352#false} assume 5 == ~blastFlag~0; {150352#false} is VALID [2022-04-08 08:48:40,026 INFO L290 TraceCheckUtils]: 185: Hoare triple {150352#false} assume !false; {150352#false} is VALID [2022-04-08 08:48:40,027 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-08 08:48:40,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:48:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441628496] [2022-04-08 08:48:40,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441628496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:40,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:40,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:40,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:48:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [989569290] [2022-04-08 08:48:40,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [989569290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:48:40,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:48:40,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:48:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113125059] [2022-04-08 08:48:40,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:48:40,028 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-08 08:48:40,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:48:40,028 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-08 08:48:40,123 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-08 08:48:40,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:48:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:40,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:48:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:48:40,124 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-08 08:48:42,144 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-08 08:48:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:43,623 INFO L93 Difference]: Finished difference Result 2452 states and 3458 transitions. [2022-04-08 08:48:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:48:43,623 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-08 08:48:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:48:43,623 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-08 08:48:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-04-08 08:48:43,625 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-08 08:48:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-04-08 08:48:43,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 380 transitions. [2022-04-08 08:48:43,826 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-08 08:48:43,897 INFO L225 Difference]: With dead ends: 2452 [2022-04-08 08:48:43,897 INFO L226 Difference]: Without dead ends: 1301 [2022-04-08 08:48:43,898 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-08 08:48:43,899 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-08 08:48:43,900 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-08 08:48:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-04-08 08:48:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1263. [2022-04-08 08:48:44,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:48:44,263 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-08 08:48:44,263 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-08 08:48:44,264 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-08 08:48:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:44,307 INFO L93 Difference]: Finished difference Result 1301 states and 1823 transitions. [2022-04-08 08:48:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1823 transitions. [2022-04-08 08:48:44,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:44,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:44,309 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-08 08:48:44,310 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-08 08:48:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:48:44,352 INFO L93 Difference]: Finished difference Result 1301 states and 1823 transitions. [2022-04-08 08:48:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1823 transitions. [2022-04-08 08:48:44,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:48:44,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:48:44,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:48:44,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:48:44,355 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-08 08:48:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1783 transitions. [2022-04-08 08:48:44,423 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1783 transitions. Word has length 186 [2022-04-08 08:48:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:48:44,424 INFO L478 AbstractCegarLoop]: Abstraction has 1263 states and 1783 transitions. [2022-04-08 08:48:44,424 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-08 08:48:44,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1263 states and 1783 transitions. [2022-04-08 08:48:45,979 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-08 08:48:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1783 transitions. [2022-04-08 08:48:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-08 08:48:45,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:48:45,981 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-08 08:48:45,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:48:45,981 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:48:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:48:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 1 times [2022-04-08 08:48:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:48:45,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715324737] [2022-04-08 08:48:59,192 WARN L232 SmtUtils]: Spent 7.63s 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-08 08:49:06,651 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1408894034, now seen corresponding path program 2 times [2022-04-08 08:49:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:06,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537819656] [2022-04-08 08:49:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:06,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:06,817 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-08 08:49:06,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {160395#true} assume true; {160395#true} is VALID [2022-04-08 08:49:06,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160395#true} {160395#true} #593#return; {160395#true} is VALID [2022-04-08 08:49:06,818 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-08 08:49:06,818 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-08 08:49:06,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {160395#true} assume true; {160395#true} is VALID [2022-04-08 08:49:06,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160395#true} {160395#true} #593#return; {160395#true} is VALID [2022-04-08 08:49:06,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {160395#true} call #t~ret158 := main(); {160395#true} is VALID [2022-04-08 08:49:06,818 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-08 08:49:06,818 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-08 08:49:06,818 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-08 08:49:06,818 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-08 08:49:06,818 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-08 08:49:06,818 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-08 08:49:06,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-08 08:49:06,818 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-08 08:49:06,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {160395#true} assume 12292 == #t~mem49;havoc #t~mem49; {160395#true} is VALID [2022-04-08 08:49:06,818 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-08 08:49:06,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {160395#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {160395#true} is VALID [2022-04-08 08:49:06,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {160395#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {160395#true} is VALID [2022-04-08 08:49:06,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {160395#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {160395#true} is VALID [2022-04-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {160395#true} assume !(0 == ~tmp___4~0); {160395#true} is VALID [2022-04-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-08 08:49:06,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {160395#true} assume 4368 == #t~mem54;havoc #t~mem54; {160395#true} is VALID [2022-04-08 08:49:06,819 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-08 08:49:06,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {160395#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {160395#true} is VALID [2022-04-08 08:49:06,819 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-08 08:49:06,819 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-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-08 08:49:06,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {160395#true} assume 4384 == #t~mem56;havoc #t~mem56; {160395#true} is VALID [2022-04-08 08:49:06,820 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-08 08:49:06,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {160395#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {160395#true} is VALID [2022-04-08 08:49:06,820 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-08 08:49:06,820 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-08 08:49:06,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {160395#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {160395#true} is VALID [2022-04-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-08 08:49:06,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {160395#true} assume 4400 == #t~mem58;havoc #t~mem58; {160395#true} is VALID [2022-04-08 08:49:06,821 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-08 08:49:06,821 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-08 08:49:06,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {160395#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {160395#true} is VALID [2022-04-08 08:49:06,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {160395#true} assume !(~ret~0 <= 0); {160395#true} is VALID [2022-04-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {160395#true} ~skip~0 := 0; {160395#true} is VALID [2022-04-08 08:49:06,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {160395#true} assume !false; {160395#true} is VALID [2022-04-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 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-08 08:49:06,822 INFO L290 TraceCheckUtils]: 91: Hoare triple {160395#true} assume 4416 == #t~mem60;havoc #t~mem60; {160395#true} is VALID [2022-04-08 08:49:06,823 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-08 08:49:06,823 INFO L290 TraceCheckUtils]: 93: Hoare triple {160395#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {160395#true} is VALID [2022-04-08 08:49:06,823 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-08 08:49:06,824 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-08 08:49:06,824 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-08 08:49:06,824 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-08 08:49:06,824 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-08 08:49:06,825 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-08 08:49:06,825 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-08 08:49:06,825 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-08 08:49:06,826 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-08 08:49:06,826 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-08 08:49:06,826 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-08 08:49:06,826 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 INFO L290 TraceCheckUtils]: 108: Hoare triple {160396#false} assume !(0 == ~blastFlag~0); {160396#false} is VALID [2022-04-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 INFO L290 TraceCheckUtils]: 113: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-08 08:49:06,827 INFO L290 TraceCheckUtils]: 114: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,827 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-08 08:49:06,828 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-08 08:49:06,828 INFO L290 TraceCheckUtils]: 123: Hoare triple {160396#false} assume 4384 == #t~mem56;havoc #t~mem56; {160396#false} is VALID [2022-04-08 08:49:06,828 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-08 08:49:06,828 INFO L290 TraceCheckUtils]: 125: Hoare triple {160396#false} assume !(1 == ~blastFlag~0); {160396#false} is VALID [2022-04-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 INFO L290 TraceCheckUtils]: 128: Hoare triple {160396#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {160396#false} is VALID [2022-04-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 INFO L290 TraceCheckUtils]: 131: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-08 08:49:06,828 INFO L290 TraceCheckUtils]: 132: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,828 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-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 INFO L290 TraceCheckUtils]: 143: Hoare triple {160396#false} assume 4400 == #t~mem58;havoc #t~mem58; {160396#false} is VALID [2022-04-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 INFO L290 TraceCheckUtils]: 146: Hoare triple {160396#false} assume !(2 == ~blastFlag~0); {160396#false} is VALID [2022-04-08 08:49:06,829 INFO L290 TraceCheckUtils]: 147: Hoare triple {160396#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {160396#false} is VALID [2022-04-08 08:49:06,829 INFO L290 TraceCheckUtils]: 148: Hoare triple {160396#false} assume !(~ret~0 <= 0); {160396#false} is VALID [2022-04-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 INFO L290 TraceCheckUtils]: 152: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-08 08:49:06,829 INFO L290 TraceCheckUtils]: 153: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,829 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-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 INFO L290 TraceCheckUtils]: 166: Hoare triple {160396#false} assume 4416 == #t~mem60;havoc #t~mem60; {160396#false} is VALID [2022-04-08 08:49:06,830 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-08 08:49:06,830 INFO L290 TraceCheckUtils]: 168: Hoare triple {160396#false} assume !(3 == ~blastFlag~0); {160396#false} is VALID [2022-04-08 08:49:06,830 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-08 08:49:06,830 INFO L290 TraceCheckUtils]: 170: Hoare triple {160396#false} assume !(0 == ~tmp___6~0); {160396#false} is VALID [2022-04-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 INFO L290 TraceCheckUtils]: 173: Hoare triple {160396#false} ~skip~0 := 0; {160396#false} is VALID [2022-04-08 08:49:06,830 INFO L290 TraceCheckUtils]: 174: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,830 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 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-08 08:49:06,831 INFO L290 TraceCheckUtils]: 189: Hoare triple {160396#false} assume 4432 == #t~mem62;havoc #t~mem62; {160396#false} is VALID [2022-04-08 08:49:06,831 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-08 08:49:06,831 INFO L290 TraceCheckUtils]: 191: Hoare triple {160396#false} assume 5 == ~blastFlag~0; {160396#false} is VALID [2022-04-08 08:49:06,831 INFO L290 TraceCheckUtils]: 192: Hoare triple {160396#false} assume !false; {160396#false} is VALID [2022-04-08 08:49:06,832 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-08 08:49:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:06,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537819656] [2022-04-08 08:49:06,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537819656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:06,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:06,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:06,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:06,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715324737] [2022-04-08 08:49:06,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715324737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:06,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:06,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288375861] [2022-04-08 08:49:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:06,833 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-08 08:49:06,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:06,833 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-08 08:49:06,902 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-08 08:49:06,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:06,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:06,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:06,903 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-08 08:49:08,919 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-08 08:49:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:10,907 INFO L93 Difference]: Finished difference Result 2743 states and 3882 transitions. [2022-04-08 08:49:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:10,907 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-08 08:49:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:10,907 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-08 08:49:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-08 08:49:10,909 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-08 08:49:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-08 08:49:10,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-08 08:49:11,216 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-08 08:49:11,333 INFO L225 Difference]: With dead ends: 2743 [2022-04-08 08:49:11,333 INFO L226 Difference]: Without dead ends: 1728 [2022-04-08 08:49:11,334 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-08 08:49:11,334 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-08 08:49:11,335 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-08 08:49:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-04-08 08:49:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1343. [2022-04-08 08:49:11,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:11,704 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-08 08:49:11,704 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-08 08:49:11,705 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-08 08:49:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:11,785 INFO L93 Difference]: Finished difference Result 1728 states and 2413 transitions. [2022-04-08 08:49:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2413 transitions. [2022-04-08 08:49:11,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:11,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:11,787 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-08 08:49:11,788 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-08 08:49:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:11,870 INFO L93 Difference]: Finished difference Result 1728 states and 2413 transitions. [2022-04-08 08:49:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2413 transitions. [2022-04-08 08:49:11,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:11,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:11,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:11,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:11,873 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-08 08:49:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1859 transitions. [2022-04-08 08:49:11,935 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1859 transitions. Word has length 193 [2022-04-08 08:49:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:11,935 INFO L478 AbstractCegarLoop]: Abstraction has 1343 states and 1859 transitions. [2022-04-08 08:49:11,935 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-08 08:49:11,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1343 states and 1859 transitions. [2022-04-08 08:49:13,892 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-08 08:49:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1859 transitions. [2022-04-08 08:49:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-08 08:49:13,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:13,894 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-08 08:49:13,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:49:13,894 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 1 times [2022-04-08 08:49:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606303378] [2022-04-08 08:49:25,188 WARN L232 SmtUtils]: Spent 6.53s 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-08 08:49:33,718 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:49:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 164938377, now seen corresponding path program 2 times [2022-04-08 08:49:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:49:33,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798291124] [2022-04-08 08:49:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:49:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:49:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:49:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:49:33,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {172042#(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); {172035#true} is VALID [2022-04-08 08:49:33,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {172035#true} assume true; {172035#true} is VALID [2022-04-08 08:49:33,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172035#true} {172035#true} #593#return; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {172035#true} call ULTIMATE.init(); {172042#(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-08 08:49:33,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {172042#(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); {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {172035#true} assume true; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172035#true} {172035#true} #593#return; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {172035#true} call #t~ret158 := main(); {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {172035#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; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {172035#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {172035#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; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {172035#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; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {172035#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {172035#true} assume !false; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {172035#true} assume 12292 == #t~mem49;havoc #t~mem49; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {172035#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; {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {172035#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {172035#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {172035#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {172035#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {172035#true} assume !(0 == ~tmp___4~0); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {172035#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {172035#true} ~skip~0 := 0; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {172035#true} assume !false; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {172035#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {172035#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {172035#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {172035#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {172035#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {172035#true} assume 4368 == #t~mem54;havoc #t~mem54; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {172035#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; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {172035#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {172035#true} is VALID [2022-04-08 08:49:33,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {172035#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; {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {172035#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {172035#true} ~skip~0 := 0; {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {172035#true} assume !false; {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {172035#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {172035#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {172035#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {172035#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {172035#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {172035#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {172035#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {172035#true} assume 4384 == #t~mem56;havoc #t~mem56; {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {172035#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {172035#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {172035#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {172035#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {172035#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 56: Hoare triple {172035#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {172035#true} ~skip~0 := 0; {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {172035#true} assume !false; {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {172035#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {172035#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {172035#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {172035#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {172035#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {172035#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {172035#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {172035#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 68: Hoare triple {172035#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {172035#true} assume 4400 == #t~mem58;havoc #t~mem58; {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {172035#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; {172035#true} is VALID [2022-04-08 08:49:33,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {172035#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {172035#true} assume !(~ret~0 <= 0); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {172035#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 76: Hoare triple {172035#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {172035#true} ~skip~0 := 0; {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {172035#true} assume !false; {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 79: Hoare triple {172035#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); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 80: Hoare triple {172035#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 81: Hoare triple {172035#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 82: Hoare triple {172035#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 83: Hoare triple {172035#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 84: Hoare triple {172035#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {172035#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {172035#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {172035#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {172035#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {172035#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {172035#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {172035#true} is VALID [2022-04-08 08:49:33,879 INFO L290 TraceCheckUtils]: 91: Hoare triple {172035#true} assume 4416 == #t~mem60;havoc #t~mem60; {172035#true} is VALID [2022-04-08 08:49:33,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {172035#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {172035#true} is VALID [2022-04-08 08:49:33,880 INFO L290 TraceCheckUtils]: 93: Hoare triple {172035#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {172035#true} is VALID [2022-04-08 08:49:33,880 INFO L290 TraceCheckUtils]: 94: Hoare triple {172035#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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,881 INFO L290 TraceCheckUtils]: 95: Hoare triple {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,881 INFO L290 TraceCheckUtils]: 96: Hoare triple {172040#(= 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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,881 INFO L290 TraceCheckUtils]: 97: Hoare triple {172040#(= 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; {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,881 INFO L290 TraceCheckUtils]: 98: Hoare triple {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,881 INFO L290 TraceCheckUtils]: 99: Hoare triple {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {172040#(= 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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {172040#(= 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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {172040#(= 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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {172040#(= 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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,883 INFO L290 TraceCheckUtils]: 104: Hoare triple {172040#(= 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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,883 INFO L290 TraceCheckUtils]: 105: Hoare triple {172040#(= 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); {172040#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:49:33,883 INFO L290 TraceCheckUtils]: 106: Hoare triple {172040#(= 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); {172041#(= |ssl3_connect_#t~mem55| 4432)} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 107: Hoare triple {172041#(= |ssl3_connect_#t~mem55| 4432)} assume 4369 == #t~mem55;havoc #t~mem55; {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 108: Hoare triple {172036#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; {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 109: Hoare triple {172036#false} assume !(0 == ~blastFlag~0); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 110: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 111: Hoare triple {172036#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; {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 112: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 113: Hoare triple {172036#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 114: Hoare triple {172036#false} ~skip~0 := 0; {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 115: Hoare triple {172036#false} assume !false; {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 116: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 117: Hoare triple {172036#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 118: Hoare triple {172036#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 119: Hoare triple {172036#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 120: Hoare triple {172036#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 121: Hoare triple {172036#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 122: Hoare triple {172036#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 123: Hoare triple {172036#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,884 INFO L290 TraceCheckUtils]: 124: Hoare triple {172036#false} assume 4384 == #t~mem56;havoc #t~mem56; {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 125: Hoare triple {172036#false} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 126: Hoare triple {172036#false} assume !(1 == ~blastFlag~0); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 127: Hoare triple {172036#false} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 128: Hoare triple {172036#false} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 129: Hoare triple {172036#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 130: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 131: Hoare triple {172036#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 132: Hoare triple {172036#false} ~skip~0 := 0; {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 133: Hoare triple {172036#false} assume !false; {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 134: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 135: Hoare triple {172036#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 136: Hoare triple {172036#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 137: Hoare triple {172036#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 138: Hoare triple {172036#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 139: Hoare triple {172036#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 140: Hoare triple {172036#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 141: Hoare triple {172036#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 142: Hoare triple {172036#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,885 INFO L290 TraceCheckUtils]: 143: Hoare triple {172036#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 144: Hoare triple {172036#false} assume 4400 == #t~mem58;havoc #t~mem58; {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 145: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 146: Hoare triple {172036#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; {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 147: Hoare triple {172036#false} assume !(2 == ~blastFlag~0); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 148: Hoare triple {172036#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 149: Hoare triple {172036#false} assume !(~ret~0 <= 0); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 150: Hoare triple {172036#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 151: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 152: Hoare triple {172036#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 153: Hoare triple {172036#false} ~skip~0 := 0; {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 154: Hoare triple {172036#false} assume !false; {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 155: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 156: Hoare triple {172036#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 157: Hoare triple {172036#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 158: Hoare triple {172036#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 159: Hoare triple {172036#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 160: Hoare triple {172036#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 161: Hoare triple {172036#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,886 INFO L290 TraceCheckUtils]: 162: Hoare triple {172036#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 163: Hoare triple {172036#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 164: Hoare triple {172036#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 165: Hoare triple {172036#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 166: Hoare triple {172036#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 167: Hoare triple {172036#false} assume 4416 == #t~mem60;havoc #t~mem60; {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 168: Hoare triple {172036#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 169: Hoare triple {172036#false} assume !(3 == ~blastFlag~0); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 170: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 171: Hoare triple {172036#false} assume !(0 == ~tmp___6~0); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 172: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 173: Hoare triple {172036#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 174: Hoare triple {172036#false} ~skip~0 := 0; {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 175: Hoare triple {172036#false} assume !false; {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 176: Hoare triple {172036#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); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 177: Hoare triple {172036#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 178: Hoare triple {172036#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 179: Hoare triple {172036#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 180: Hoare triple {172036#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,887 INFO L290 TraceCheckUtils]: 181: Hoare triple {172036#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 182: Hoare triple {172036#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 183: Hoare triple {172036#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 184: Hoare triple {172036#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 185: Hoare triple {172036#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 186: Hoare triple {172036#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 187: Hoare triple {172036#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 188: Hoare triple {172036#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 189: Hoare triple {172036#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 190: Hoare triple {172036#false} assume 4432 == #t~mem62;havoc #t~mem62; {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 191: Hoare triple {172036#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 192: Hoare triple {172036#false} assume 5 == ~blastFlag~0; {172036#false} is VALID [2022-04-08 08:49:33,888 INFO L290 TraceCheckUtils]: 193: Hoare triple {172036#false} assume !false; {172036#false} is VALID [2022-04-08 08:49:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-08 08:49:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:49:33,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798291124] [2022-04-08 08:49:33,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798291124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:33,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:33,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:33,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:49:33,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606303378] [2022-04-08 08:49:33,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606303378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:49:33,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:49:33,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:49:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021636904] [2022-04-08 08:49:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:49:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 194 [2022-04-08 08:49:33,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:49:33,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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-08 08:49:33,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:33,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:49:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:33,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:49:33,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:49:33,947 INFO L87 Difference]: Start difference. First operand 1343 states and 1859 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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-08 08:49:35,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-08 08:49:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:37,289 INFO L93 Difference]: Finished difference Result 2448 states and 3381 transitions. [2022-04-08 08:49:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:49:37,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 194 [2022-04-08 08:49:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:49:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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-08 08:49:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-08 08:49:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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-08 08:49:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-04-08 08:49:37,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 374 transitions. [2022-04-08 08:49:37,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:37,508 INFO L225 Difference]: With dead ends: 2448 [2022-04-08 08:49:37,508 INFO L226 Difference]: Without dead ends: 1369 [2022-04-08 08:49:37,509 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-08 08:49:37,509 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 26 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:49:37,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 467 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 335 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:49:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-04-08 08:49:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1343. [2022-04-08 08:49:37,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:49:37,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1369 states. Second operand has 1343 states, 1338 states have (on average 1.383408071748879) internal successors, (1851), 1338 states have internal predecessors, (1851), 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-08 08:49:37,820 INFO L74 IsIncluded]: Start isIncluded. First operand 1369 states. Second operand has 1343 states, 1338 states have (on average 1.383408071748879) internal successors, (1851), 1338 states have internal predecessors, (1851), 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-08 08:49:37,820 INFO L87 Difference]: Start difference. First operand 1369 states. Second operand has 1343 states, 1338 states have (on average 1.383408071748879) internal successors, (1851), 1338 states have internal predecessors, (1851), 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-08 08:49:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:37,867 INFO L93 Difference]: Finished difference Result 1369 states and 1882 transitions. [2022-04-08 08:49:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1882 transitions. [2022-04-08 08:49:37,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:37,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:37,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 1343 states, 1338 states have (on average 1.383408071748879) internal successors, (1851), 1338 states have internal predecessors, (1851), 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 1369 states. [2022-04-08 08:49:37,870 INFO L87 Difference]: Start difference. First operand has 1343 states, 1338 states have (on average 1.383408071748879) internal successors, (1851), 1338 states have internal predecessors, (1851), 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 1369 states. [2022-04-08 08:49:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:49:37,918 INFO L93 Difference]: Finished difference Result 1369 states and 1882 transitions. [2022-04-08 08:49:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1882 transitions. [2022-04-08 08:49:37,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:49:37,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:49:37,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:49:37,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:49:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1338 states have (on average 1.383408071748879) internal successors, (1851), 1338 states have internal predecessors, (1851), 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-08 08:49:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1855 transitions. [2022-04-08 08:49:37,984 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1855 transitions. Word has length 194 [2022-04-08 08:49:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:49:37,984 INFO L478 AbstractCegarLoop]: Abstraction has 1343 states and 1855 transitions. [2022-04-08 08:49:37,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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-08 08:49:37,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1343 states and 1855 transitions. [2022-04-08 08:49:39,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1855 edges. 1855 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:49:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1855 transitions. [2022-04-08 08:49:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-04-08 08:49:39,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:49:39,889 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:49:39,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:49:39,890 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:49:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:49:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1734988588, now seen corresponding path program 1 times [2022-04-08 08:49:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:49:39,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2123110385] [2022-04-08 08:49:53,634 WARN L232 SmtUtils]: Spent 8.71s 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-08 08:50:02,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:50:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1734988588, now seen corresponding path program 2 times [2022-04-08 08:50:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:50:02,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970742124] [2022-04-08 08:50:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:50:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:50:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:50:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:50:02,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {182374#(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); {182367#true} is VALID [2022-04-08 08:50:02,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {182367#true} assume true; {182367#true} is VALID [2022-04-08 08:50:02,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {182367#true} {182367#true} #593#return; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {182367#true} call ULTIMATE.init(); {182374#(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-08 08:50:02,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {182374#(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); {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {182367#true} assume true; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182367#true} {182367#true} #593#return; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {182367#true} call #t~ret158 := main(); {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {182367#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; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {182367#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {182367#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; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {182367#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; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {182367#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {182367#true} assume !false; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {182367#true} assume 12292 == #t~mem49;havoc #t~mem49; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {182367#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; {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {182367#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {182367#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {182367#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {182367#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 4294967296);havoc #t~mem85.base, #t~mem85.offset; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {182367#true} assume !(0 == ~tmp___4~0); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {182367#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {182367#true} ~skip~0 := 0; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {182367#true} assume !false; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {182367#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {182367#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {182367#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {182367#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {182367#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {182367#true} assume 4368 == #t~mem54;havoc #t~mem54; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {182367#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; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {182367#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {182367#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; {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {182367#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {182367#true} ~skip~0 := 0; {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {182367#true} assume !false; {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {182367#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {182367#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {182367#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {182367#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {182367#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {182367#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {182367#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {182367#true} assume 4384 == #t~mem56;havoc #t~mem56; {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {182367#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {182367#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {182367#true} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 92 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {182367#true} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {182367#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 55: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {182367#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 57: Hoare triple {182367#true} ~skip~0 := 0; {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {182367#true} assume !false; {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {182367#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {182367#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {182367#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 63: Hoare triple {182367#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {182367#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {182367#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 66: Hoare triple {182367#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {182367#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {182367#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 69: Hoare triple {182367#true} assume 4400 == #t~mem58;havoc #t~mem58; {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {182367#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; {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 72: Hoare triple {182367#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {182367#true} is VALID [2022-04-08 08:50:02,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {182367#true} assume !(~ret~0 <= 0); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {182367#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {182367#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {182367#true} ~skip~0 := 0; {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 78: Hoare triple {182367#true} assume !false; {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 79: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 80: Hoare triple {182367#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {182367#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 82: Hoare triple {182367#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 83: Hoare triple {182367#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 84: Hoare triple {182367#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 85: Hoare triple {182367#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 86: Hoare triple {182367#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 87: Hoare triple {182367#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 88: Hoare triple {182367#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 89: Hoare triple {182367#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 90: Hoare triple {182367#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 91: Hoare triple {182367#true} assume 4416 == #t~mem60;havoc #t~mem60; {182367#true} is VALID [2022-04-08 08:50:02,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {182367#true} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 93: Hoare triple {182367#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 94: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 95: Hoare triple {182367#true} assume !(0 == ~tmp___6~0); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 96: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 97: Hoare triple {182367#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 98: Hoare triple {182367#true} ~skip~0 := 0; {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 99: Hoare triple {182367#true} assume !false; {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 100: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 101: Hoare triple {182367#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 102: Hoare triple {182367#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 103: Hoare triple {182367#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 104: Hoare triple {182367#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 105: Hoare triple {182367#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 106: Hoare triple {182367#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 107: Hoare triple {182367#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 108: Hoare triple {182367#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 109: Hoare triple {182367#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 110: Hoare triple {182367#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,829 INFO L290 TraceCheckUtils]: 111: Hoare triple {182367#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 112: Hoare triple {182367#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 113: Hoare triple {182367#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 114: Hoare triple {182367#true} assume 4432 == #t~mem62;havoc #t~mem62; {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 115: Hoare triple {182367#true} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 116: Hoare triple {182367#true} assume !(5 == ~blastFlag~0); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 117: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 118: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 119: Hoare triple {182367#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 120: Hoare triple {182367#true} ~skip~0 := 0; {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 121: Hoare triple {182367#true} assume !false; {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 122: Hoare triple {182367#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); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 123: Hoare triple {182367#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 124: Hoare triple {182367#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 125: Hoare triple {182367#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 126: Hoare triple {182367#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 127: Hoare triple {182367#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 128: Hoare triple {182367#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 129: Hoare triple {182367#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,830 INFO L290 TraceCheckUtils]: 130: Hoare triple {182367#true} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 131: Hoare triple {182367#true} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 132: Hoare triple {182367#true} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 133: Hoare triple {182367#true} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 134: Hoare triple {182367#true} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 135: Hoare triple {182367#true} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 136: Hoare triple {182367#true} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 137: Hoare triple {182367#true} assume !(4433 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 138: Hoare triple {182367#true} assume 4448 == #t~mem64;havoc #t~mem64; {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 139: Hoare triple {182367#true} assume -2147483648 <= #t~nondet100 && #t~nondet100 <= 2147483647;~ret~0 := #t~nondet100;havoc #t~nondet100; {182367#true} is VALID [2022-04-08 08:50:02,831 INFO L290 TraceCheckUtils]: 140: Hoare triple {182367#true} 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); {182367#true} is VALID [2022-04-08 08:50:02,832 INFO L290 TraceCheckUtils]: 141: Hoare triple {182367#true} assume !(0 != #t~mem102);havoc #t~mem101.base, #t~mem101.offset;havoc #t~mem102;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,832 INFO L290 TraceCheckUtils]: 142: Hoare triple {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,833 INFO L290 TraceCheckUtils]: 143: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,833 INFO L290 TraceCheckUtils]: 144: Hoare triple {182372#(= 4480 (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; {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,833 INFO L290 TraceCheckUtils]: 145: Hoare triple {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,834 INFO L290 TraceCheckUtils]: 146: Hoare triple {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,834 INFO L290 TraceCheckUtils]: 147: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,834 INFO L290 TraceCheckUtils]: 148: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,834 INFO L290 TraceCheckUtils]: 149: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,835 INFO L290 TraceCheckUtils]: 150: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,835 INFO L290 TraceCheckUtils]: 151: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,835 INFO L290 TraceCheckUtils]: 152: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,836 INFO L290 TraceCheckUtils]: 153: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,836 INFO L290 TraceCheckUtils]: 154: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,836 INFO L290 TraceCheckUtils]: 155: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,836 INFO L290 TraceCheckUtils]: 156: Hoare triple {182372#(= 4480 (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); {182372#(= 4480 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 157: Hoare triple {182372#(= 4480 (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); {182373#(= |ssl3_connect_#t~mem59| 4480)} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 158: Hoare triple {182373#(= |ssl3_connect_#t~mem59| 4480)} assume 4401 == #t~mem59;havoc #t~mem59; {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 159: Hoare triple {182368#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); {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 160: Hoare triple {182368#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; {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 161: Hoare triple {182368#false} assume !(2 == ~blastFlag~0); {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 162: Hoare triple {182368#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 163: Hoare triple {182368#false} assume !(~ret~0 <= 0); {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 164: Hoare triple {182368#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 165: Hoare triple {182368#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); {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 166: Hoare triple {182368#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182368#false} is VALID [2022-04-08 08:50:02,837 INFO L290 TraceCheckUtils]: 167: Hoare triple {182368#false} ~skip~0 := 0; {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 168: Hoare triple {182368#false} assume !false; {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 169: Hoare triple {182368#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); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 170: Hoare triple {182368#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 171: Hoare triple {182368#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 172: Hoare triple {182368#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 173: Hoare triple {182368#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 174: Hoare triple {182368#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 175: Hoare triple {182368#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 176: Hoare triple {182368#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 177: Hoare triple {182368#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 178: Hoare triple {182368#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 179: Hoare triple {182368#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 180: Hoare triple {182368#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 181: Hoare triple {182368#false} assume 4416 == #t~mem60;havoc #t~mem60; {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 182: Hoare triple {182368#false} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 183: Hoare triple {182368#false} assume !(3 == ~blastFlag~0); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 184: Hoare triple {182368#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); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 185: Hoare triple {182368#false} assume !(0 == ~tmp___6~0); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 186: Hoare triple {182368#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); {182368#false} is VALID [2022-04-08 08:50:02,838 INFO L290 TraceCheckUtils]: 187: Hoare triple {182368#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 188: Hoare triple {182368#false} ~skip~0 := 0; {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 189: Hoare triple {182368#false} assume !false; {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 190: Hoare triple {182368#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); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 191: Hoare triple {182368#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 192: Hoare triple {182368#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 193: Hoare triple {182368#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 194: Hoare triple {182368#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 195: Hoare triple {182368#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 196: Hoare triple {182368#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 197: Hoare triple {182368#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 198: Hoare triple {182368#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 199: Hoare triple {182368#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 200: Hoare triple {182368#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 201: Hoare triple {182368#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 202: Hoare triple {182368#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 203: Hoare triple {182368#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 204: Hoare triple {182368#false} assume 4432 == #t~mem62;havoc #t~mem62; {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 205: Hoare triple {182368#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {182368#false} is VALID [2022-04-08 08:50:02,839 INFO L290 TraceCheckUtils]: 206: Hoare triple {182368#false} assume 5 == ~blastFlag~0; {182368#false} is VALID [2022-04-08 08:50:02,840 INFO L290 TraceCheckUtils]: 207: Hoare triple {182368#false} assume !false; {182368#false} is VALID [2022-04-08 08:50:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-08 08:50:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:50:02,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970742124] [2022-04-08 08:50:02,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970742124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:02,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:02,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:02,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:50:02,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2123110385] [2022-04-08 08:50:02,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2123110385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:50:02,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:50:02,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:50:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426150693] [2022-04-08 08:50:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:50:02,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 208 [2022-04-08 08:50:02,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:50:02,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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-08 08:50:02,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:02,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:50:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:50:02,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:50:02,909 INFO L87 Difference]: Start difference. First operand 1343 states and 1855 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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-08 08:50:04,926 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-08 08:50:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:06,823 INFO L93 Difference]: Finished difference Result 3031 states and 4208 transitions. [2022-04-08 08:50:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:50:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 208 [2022-04-08 08:50:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:50:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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-08 08:50:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:50:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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-08 08:50:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-04-08 08:50:06,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 440 transitions. [2022-04-08 08:50:07,057 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-08 08:50:07,192 INFO L225 Difference]: With dead ends: 3031 [2022-04-08 08:50:07,192 INFO L226 Difference]: Without dead ends: 1704 [2022-04-08 08:50:07,194 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-08 08:50:07,194 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 72 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:50:07,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 530 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:50:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2022-04-08 08:50:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1348. [2022-04-08 08:50:07,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:50:07,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1704 states. Second operand has 1348 states, 1343 states have (on average 1.3819806403574089) internal successors, (1856), 1343 states have internal predecessors, (1856), 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-08 08:50:07,579 INFO L74 IsIncluded]: Start isIncluded. First operand 1704 states. Second operand has 1348 states, 1343 states have (on average 1.3819806403574089) internal successors, (1856), 1343 states have internal predecessors, (1856), 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-08 08:50:07,579 INFO L87 Difference]: Start difference. First operand 1704 states. Second operand has 1348 states, 1343 states have (on average 1.3819806403574089) internal successors, (1856), 1343 states have internal predecessors, (1856), 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-08 08:50:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:07,660 INFO L93 Difference]: Finished difference Result 1704 states and 2368 transitions. [2022-04-08 08:50:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2368 transitions. [2022-04-08 08:50:07,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:07,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:07,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 1348 states, 1343 states have (on average 1.3819806403574089) internal successors, (1856), 1343 states have internal predecessors, (1856), 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 1704 states. [2022-04-08 08:50:07,663 INFO L87 Difference]: Start difference. First operand has 1348 states, 1343 states have (on average 1.3819806403574089) internal successors, (1856), 1343 states have internal predecessors, (1856), 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 1704 states. [2022-04-08 08:50:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:50:07,742 INFO L93 Difference]: Finished difference Result 1704 states and 2368 transitions. [2022-04-08 08:50:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2368 transitions. [2022-04-08 08:50:07,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:50:07,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:50:07,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:50:07,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:50:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1343 states have (on average 1.3819806403574089) internal successors, (1856), 1343 states have internal predecessors, (1856), 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-08 08:50:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1860 transitions. [2022-04-08 08:50:07,820 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1860 transitions. Word has length 208 [2022-04-08 08:50:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:50:07,820 INFO L478 AbstractCegarLoop]: Abstraction has 1348 states and 1860 transitions. [2022-04-08 08:50:07,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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-08 08:50:07,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1348 states and 1860 transitions. [2022-04-08 08:50:09,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1860 edges. 1860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:50:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1860 transitions. [2022-04-08 08:50:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-04-08 08:50:09,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:50:09,500 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:50:09,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 08:50:09,500 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:50:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:50:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash -518834862, now seen corresponding path program 1 times [2022-04-08 08:50:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:50:09,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [981889399] [2022-04-08 08:50:23,461 WARN L232 SmtUtils]: Spent 9.79s 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)